---
_id: '2040'
abstract:
- lang: eng
text: 'Development requires tissue growth as well as cell diversification. To address
how these processes are coordinated, we analyzed the development of molecularly
distinct domains of neural progenitors in the mouse and chick neural tube. We
show that during development, these domains undergo changes in size that do not
scale with changes in overall tissue size. Our data show that domain proportions
are first established by opposing morphogen gradients and subsequently controlled
by domain-specific regulation of differentiation rate but not differences in proliferation
rate. Regulation of differentiation rate is key to maintaining domain proportions
while accommodating both intra- and interspecies variations in size. Thus, the
sequential control of progenitor specification and differentiation elaborates
pattern without requiring that signaling gradients grow as tissues expand. '
article_number: '1254927'
author:
- first_name: Anna
full_name: Kicheva, Anna
last_name: Kicheva
- first_name: Mark Tobias
full_name: Bollenbach, Mark Tobias
id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
last_name: Bollenbach
orcid: 0000-0003-4398-476X
- first_name: Ana
full_name: Ribeiro, Ana
last_name: Ribeiro
- first_name: Helena
full_name: Pérez Valle, Helena
last_name: Pérez Valle
- first_name: Robin
full_name: Lovell Badge, Robin
last_name: Lovell Badge
- first_name: Vasso
full_name: Episkopou, Vasso
last_name: Episkopou
- first_name: James
full_name: Briscoe, James
last_name: Briscoe
citation:
ama: Kicheva A, Bollenbach MT, Ribeiro A, et al. Coordination of progenitor specification
and growth in mouse and chick spinal cord. Science. 2014;345(6204). doi:10.1126/science.1254927
apa: Kicheva, A., Bollenbach, M. T., Ribeiro, A., Pérez Valle, H., Lovell Badge,
R., Episkopou, V., & Briscoe, J. (2014). Coordination of progenitor specification
and growth in mouse and chick spinal cord. Science. American Association
for the Advancement of Science. https://doi.org/10.1126/science.1254927
chicago: Kicheva, Anna, Mark Tobias Bollenbach, Ana Ribeiro, Helena Pérez Valle,
Robin Lovell Badge, Vasso Episkopou, and James Briscoe. “Coordination of Progenitor
Specification and Growth in Mouse and Chick Spinal Cord.” Science. American
Association for the Advancement of Science, 2014. https://doi.org/10.1126/science.1254927.
ieee: A. Kicheva et al., “Coordination of progenitor specification and growth
in mouse and chick spinal cord,” Science, vol. 345, no. 6204. American
Association for the Advancement of Science, 2014.
ista: Kicheva A, Bollenbach MT, Ribeiro A, Pérez Valle H, Lovell Badge R, Episkopou
V, Briscoe J. 2014. Coordination of progenitor specification and growth in mouse
and chick spinal cord. Science. 345(6204), 1254927.
mla: Kicheva, Anna, et al. “Coordination of Progenitor Specification and Growth
in Mouse and Chick Spinal Cord.” Science, vol. 345, no. 6204, 1254927,
American Association for the Advancement of Science, 2014, doi:10.1126/science.1254927.
short: A. Kicheva, M.T. Bollenbach, A. Ribeiro, H. Pérez Valle, R. Lovell Badge,
V. Episkopou, J. Briscoe, Science 345 (2014).
date_created: 2018-12-11T11:55:22Z
date_published: 2014-09-26T00:00:00Z
date_updated: 2021-01-12T06:54:55Z
day: '26'
department:
- _id: ToBo
doi: 10.1126/science.1254927
intvolume: ' 345'
issue: '6204'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4228193/
month: '09'
oa: 1
oa_version: Submitted Version
publication: Science
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '5011'
quality_controlled: '1'
scopus_import: 1
status: public
title: Coordination of progenitor specification and growth in mouse and chick spinal
cord
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 345
year: '2014'
...
---
_id: '2047'
abstract:
- lang: eng
text: Following the publication of an attack on genome-wide association studies
(GWAS) data proposed by Homer et al., considerable attention has been given to
developing methods for releasing GWAS data in a privacy-preserving way. Here,
we develop an end-to-end differentially private method for solving regression
problems with convex penalty functions and selecting the penalty parameters by
cross-validation. In particular, we focus on penalized logistic regression with
elastic-net regularization, a method widely used to in GWAS analyses to identify
disease-causing genes. We show how a differentially private procedure for penalized
logistic regression with elastic-net regularization can be applied to the analysis
of GWAS data and evaluate our method’s performance.
acknowledgement: This research was partially supported by BCS- 0941518 to the Department
of Statistics at Carnegie Mellon University.
alternative_title:
- LNCS
author:
- first_name: Fei
full_name: Yu, Fei
last_name: Yu
- first_name: Michal
full_name: Rybar, Michal
id: 2B3E3DE8-F248-11E8-B48F-1D18A9856A87
last_name: Rybar
- first_name: Caroline
full_name: Uhler, Caroline
id: 49ADD78E-F248-11E8-B48F-1D18A9856A87
last_name: Uhler
orcid: 0000-0002-7008-0216
- first_name: Stephen
full_name: Fienberg, Stephen
last_name: Fienberg
citation:
ama: 'Yu F, Rybar M, Uhler C, Fienberg S. Differentially-private logistic regression
for detecting multiple-SNP association in GWAS databases. In: Domingo Ferrer J,
ed. Lecture Notes in Computer Science (Including Subseries Lecture Notes in
Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 8744. Springer;
2014:170-184. doi:10.1007/978-3-319-11257-2_14'
apa: 'Yu, F., Rybar, M., Uhler, C., & Fienberg, S. (2014). Differentially-private
logistic regression for detecting multiple-SNP association in GWAS databases.
In J. Domingo Ferrer (Ed.), Lecture Notes in Computer Science (including subseries
Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
(Vol. 8744, pp. 170–184). Ibiza, Spain: Springer. https://doi.org/10.1007/978-3-319-11257-2_14'
chicago: Yu, Fei, Michal Rybar, Caroline Uhler, and Stephen Fienberg. “Differentially-Private
Logistic Regression for Detecting Multiple-SNP Association in GWAS Databases.”
In Lecture Notes in Computer Science (Including Subseries Lecture Notes in
Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Josep
Domingo Ferrer, 8744:170–84. Springer, 2014. https://doi.org/10.1007/978-3-319-11257-2_14.
ieee: F. Yu, M. Rybar, C. Uhler, and S. Fienberg, “Differentially-private logistic
regression for detecting multiple-SNP association in GWAS databases,” in Lecture
Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics), Ibiza, Spain, 2014, vol. 8744, pp. 170–184.
ista: 'Yu F, Rybar M, Uhler C, Fienberg S. 2014. Differentially-private logistic
regression for detecting multiple-SNP association in GWAS databases. Lecture Notes
in Computer Science (including subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics). PSD: Privacy in Statistical Databases, LNCS,
vol. 8744, 170–184.'
mla: Yu, Fei, et al. “Differentially-Private Logistic Regression for Detecting Multiple-SNP
Association in GWAS Databases.” Lecture Notes in Computer Science (Including
Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
edited by Josep Domingo Ferrer, vol. 8744, Springer, 2014, pp. 170–84, doi:10.1007/978-3-319-11257-2_14.
short: F. Yu, M. Rybar, C. Uhler, S. Fienberg, in:, J. Domingo Ferrer (Ed.), Lecture
Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics), Springer, 2014, pp. 170–184.
conference:
end_date: 2014-09-19
location: Ibiza, Spain
name: 'PSD: Privacy in Statistical Databases'
start_date: 2014-09-17
date_created: 2018-12-11T11:55:24Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:54:57Z
day: '01'
department:
- _id: KrPi
- _id: CaUh
doi: 10.1007/978-3-319-11257-2_14
editor:
- first_name: Josep
full_name: Domingo Ferrer, Josep
last_name: Domingo Ferrer
external_id:
arxiv:
- '1407.8067'
intvolume: ' 8744'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1407.8067
month: '01'
oa: 1
oa_version: Submitted Version
page: 170 - 184
project:
- _id: 25636330-B435-11E9-9278-68D0E5697425
grant_number: 11-NSF-1070
name: ROOTS Genome-wide Analysis of Root Traits
publication: Lecture Notes in Computer Science (including subseries Lecture Notes
in Artificial Intelligence and Lecture Notes in Bioinformatics)
publication_status: published
publisher: Springer
publist_id: '5004'
quality_controlled: '1'
scopus_import: 1
status: public
title: Differentially-private logistic regression for detecting multiple-SNP association
in GWAS databases
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8744
year: '2014'
...
---
_id: '2053'
abstract:
- lang: eng
text: In contrast to the usual understanding of probabilistic systems as stochastic
processes, recently these systems have also been regarded as transformers of probabilities.
In this paper, we give a natural definition of strong bisimulation for probabilistic
systems corresponding to this view that treats probability distributions as first-class
citizens. Our definition applies in the same way to discrete systems as well as
to systems with uncountable state and action spaces. Several examples demonstrate
that our definition refines the understanding of behavioural equivalences of probabilistic
systems. In particular, it solves a longstanding open problem concerning the representation
of memoryless continuous time by memoryfull continuous time. Finally, we give
algorithms for computing this bisimulation not only for finite but also for classes
of uncountably infinite systems.
acknowledgement: This work is supported by the EU 7th Framework Programme under grant
agreements 295261 (MEALS) and 318490 (SENSATION), Czech Science Foundation under
grant agreement P202/12/G061, the DFG Transregional Collaborative Research Centre
SFB/TR 14 AVACS, and by the CAS/SAFEA International Partnership Program for Creative
Research Teams.
alternative_title:
- LNCS
author:
- first_name: Holger
full_name: Hermanns, Holger
last_name: Hermanns
- first_name: Jan
full_name: Krčál, Jan
last_name: Krčál
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
citation:
ama: 'Hermanns H, Krčál J, Kretinsky J. Probabilistic bisimulation: Naturally on
distributions. In: Baldan P, Gorla D, eds. Lecture Notes in Computer Science
(Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes
in Bioinformatics). Vol 8704. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2014:249-265. doi:10.1007/978-3-662-44584-6_18'
apa: 'Hermanns, H., Krčál, J., & Kretinsky, J. (2014). Probabilistic bisimulation:
Naturally on distributions. In P. Baldan & D. Gorla (Eds.), Lecture Notes
in Computer Science (including subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 249–265). Rome, Italy:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-662-44584-6_18'
chicago: 'Hermanns, Holger, Jan Krčál, and Jan Kretinsky. “Probabilistic Bisimulation:
Naturally on Distributions.” In Lecture Notes in Computer Science (Including
Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
edited by Paolo Baldan and Daniele Gorla, 8704:249–65. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2014. https://doi.org/10.1007/978-3-662-44584-6_18.'
ieee: 'H. Hermanns, J. Krčál, and J. Kretinsky, “Probabilistic bisimulation: Naturally
on distributions,” in Lecture Notes in Computer Science (including subseries
Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
Rome, Italy, 2014, vol. 8704, pp. 249–265.'
ista: 'Hermanns H, Krčál J, Kretinsky J. 2014. Probabilistic bisimulation: Naturally
on distributions. Lecture Notes in Computer Science (including subseries Lecture
Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR:
Concurrency Theory, LNCS, vol. 8704, 249–265.'
mla: 'Hermanns, Holger, et al. “Probabilistic Bisimulation: Naturally on Distributions.”
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan
and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2014, pp. 249–65, doi:10.1007/978-3-662-44584-6_18.'
short: H. Hermanns, J. Krčál, J. Kretinsky, in:, P. Baldan, D. Gorla (Eds.), Lecture
Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics), Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2014, pp. 249–265.
conference:
end_date: 2014-09-05
location: Rome, Italy
name: 'CONCUR: Concurrency Theory'
start_date: 2014-09-02
date_created: 2018-12-11T11:55:27Z
date_published: 2014-09-01T00:00:00Z
date_updated: 2021-01-12T06:55:00Z
day: '01'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1007/978-3-662-44584-6_18
ec_funded: 1
editor:
- first_name: Paolo
full_name: Baldan, Paolo
last_name: Baldan
- first_name: Daniele
full_name: Gorla, Daniele
last_name: Gorla
intvolume: ' 8704'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1404.5084
month: '09'
oa: 1
oa_version: Submitted Version
page: 249 - 265
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: Lecture Notes in Computer Science (including subseries Lecture Notes
in Artificial Intelligence and Lecture Notes in Bioinformatics)
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '4993'
status: public
title: 'Probabilistic bisimulation: Naturally on distributions'
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 8704
year: '2014'
...
---
_id: '2052'
abstract:
- lang: eng
text: A standard technique for solving the parameterized model checking problem
is to reduce it to the classic model checking problem of finitely many finite-state
systems. This work considers some of the theoretical power and limitations of
this technique. We focus on concurrent systems in which processes communicate
via pairwise rendezvous, as well as the special cases of disjunctive guards and
token passing; specifications are expressed in indexed temporal logic without
the next operator; and the underlying network topologies are generated by suitable
Monadic Second Order Logic formulas and graph operations. First, we settle the
exact computational complexity of the parameterized model checking problem for
some of our concurrent systems, and establish new decidability results for others.
Second, we consider the cases that model checking the parameterized system can
be reduced to model checking some fixed number of processes, the number is known
as a cutoff. We provide many cases for when such cutoffs can be computed, establish
lower bounds on the size of such cutoffs, and identify cases where no cutoff exists.
Third, we consider cases for which the parameterized system is equivalent to a
single finite-state system (more precisely a Büchi word automaton), and establish
tight bounds on the sizes of such automata.
acknowledgement: The second, third, fourth and fifth authors were supported by the
Austrian National Research Network S11403-N23 (RiSE) of the Austrian Science Fund
(FWF) and by the Vienna Science and Technology Fund (WWTF) through grants PROSEED,
ICT12-059, and VRG11-005.
alternative_title:
- LNCS
author:
- first_name: Benjamin
full_name: Aminof, Benjamin
id: 4A55BD00-F248-11E8-B48F-1D18A9856A87
last_name: Aminof
- first_name: Tomer
full_name: Kotek, Tomer
last_name: Kotek
- first_name: Sacha
full_name: Rubin, Sacha
last_name: Rubin
- first_name: Francesco
full_name: Spegni, Francesco
last_name: Spegni
- first_name: Helmut
full_name: Veith, Helmut
last_name: Veith
citation:
ama: 'Aminof B, Kotek T, Rubin S, Spegni F, Veith H. Parameterized model checking
of rendezvous systems. In: Baldan P, Gorla D, eds. Lecture Notes in Computer
Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture
Notes in Bioinformatics). Vol 8704. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2014:109-124. doi:10.1007/978-3-662-44584-6_9'
apa: 'Aminof, B., Kotek, T., Rubin, S., Spegni, F., & Veith, H. (2014). Parameterized
model checking of rendezvous systems. In P. Baldan & D. Gorla (Eds.), Lecture
Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 109–124). Rome, Italy:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-662-44584-6_9'
chicago: Aminof, Benjamin, Tomer Kotek, Sacha Rubin, Francesco Spegni, and Helmut
Veith. “Parameterized Model Checking of Rendezvous Systems.” In Lecture Notes
in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla,
8704:109–24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. https://doi.org/10.1007/978-3-662-44584-6_9.
ieee: B. Aminof, T. Kotek, S. Rubin, F. Spegni, and H. Veith, “Parameterized model
checking of rendezvous systems,” in Lecture Notes in Computer Science (including
subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
Rome, Italy, 2014, vol. 8704, pp. 109–124.
ista: 'Aminof B, Kotek T, Rubin S, Spegni F, Veith H. 2014. Parameterized model
checking of rendezvous systems. Lecture Notes in Computer Science (including subseries
Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).
CONCUR: Concurrency Theory, LNCS, vol. 8704, 109–124.'
mla: Aminof, Benjamin, et al. “Parameterized Model Checking of Rendezvous Systems.”
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan
and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2014, pp. 109–24, doi:10.1007/978-3-662-44584-6_9.
short: B. Aminof, T. Kotek, S. Rubin, F. Spegni, H. Veith, in:, P. Baldan, D. Gorla
(Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in
Artificial Intelligence and Lecture Notes in Bioinformatics), Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2014, pp. 109–124.
conference:
end_date: 2014-09-05
location: Rome, Italy
name: 'CONCUR: Concurrency Theory'
start_date: 2014-09-02
date_created: 2018-12-11T11:55:26Z
date_published: 2014-09-01T00:00:00Z
date_updated: 2021-01-12T06:54:59Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-662-44584-6_9
editor:
- first_name: Paolo
full_name: Baldan, Paolo
last_name: Baldan
- first_name: Daniele
full_name: Gorla, Daniele
last_name: Gorla
intvolume: ' 8704'
language:
- iso: eng
month: '09'
oa_version: None
page: 109 - 124
publication: Lecture Notes in Computer Science (including subseries Lecture Notes
in Artificial Intelligence and Lecture Notes in Bioinformatics)
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '4994'
quality_controlled: '1'
status: public
title: Parameterized model checking of rendezvous systems
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 8704
year: '2014'
...
---
_id: '2046'
abstract:
- lang: eng
text: 'We introduce policy-based signatures (PBS), where a signer can only sign
messages conforming to some authority-specified policy. The main requirements
are unforgeability and privacy, the latter meaning that signatures not reveal
the policy. PBS offers value along two fronts: (1) On the practical side, they
allow a corporation to control what messages its employees can sign under the
corporate key. (2) On the theoretical side, they unify existing work, capturing
other forms of signatures as special cases or allowing them to be easily built.
Our work focuses on definitions of PBS, proofs that this challenging primitive
is realizable for arbitrary policies, efficient constructions for specific policies,
and a few representative applications.'
acknowledgement: Part of his work was done while at Bristol University, supported
by EPSRC grant EP/H043454/1.
alternative_title:
- LNCS
author:
- first_name: Mihir
full_name: Bellare, Mihir
last_name: Bellare
- first_name: Georg
full_name: Fuchsbauer, Georg
id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
last_name: Fuchsbauer
citation:
ama: 'Bellare M, Fuchsbauer G. Policy-based signatures. In: Krawczyk H, ed. Lecture
Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics). Vol 8383. Springer; 2014:520-537. doi:10.1007/978-3-642-54631-0_30'
apa: 'Bellare, M., & Fuchsbauer, G. (2014). Policy-based signatures. In H. Krawczyk
(Ed.), Lecture Notes in Computer Science (including subseries Lecture Notes
in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8383,
pp. 520–537). Buenos Aires, Argentina: Springer. https://doi.org/10.1007/978-3-642-54631-0_30'
chicago: Bellare, Mihir, and Georg Fuchsbauer. “Policy-Based Signatures.” In Lecture
Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics), edited by Hugo Krawczyk, 8383:520–37.
Springer, 2014. https://doi.org/10.1007/978-3-642-54631-0_30.
ieee: M. Bellare and G. Fuchsbauer, “Policy-based signatures,” in Lecture Notes
in Computer Science (including subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics), Buenos Aires, Argentina, 2014, vol.
8383, pp. 520–537.
ista: 'Bellare M, Fuchsbauer G. 2014. Policy-based signatures. Lecture Notes in
Computer Science (including subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics). PKC: Public Key Crypography, LNCS, vol.
8383, 520–537.'
mla: Bellare, Mihir, and Georg Fuchsbauer. “Policy-Based Signatures.” Lecture
Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics), edited by Hugo Krawczyk, vol. 8383,
Springer, 2014, pp. 520–37, doi:10.1007/978-3-642-54631-0_30.
short: M. Bellare, G. Fuchsbauer, in:, H. Krawczyk (Ed.), Lecture Notes in Computer
Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture
Notes in Bioinformatics), Springer, 2014, pp. 520–537.
conference:
end_date: 2014-05-28
location: Buenos Aires, Argentina
name: 'PKC: Public Key Crypography'
start_date: 2014-05-26
date_created: 2018-12-11T11:55:24Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:54:57Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-642-54631-0_30
ec_funded: 1
editor:
- first_name: Hugo
full_name: Krawczyk, Hugo
last_name: Krawczyk
intvolume: ' 8383'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2013/413
month: '01'
oa: 1
oa_version: Submitted Version
page: 520 - 537
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication: Lecture Notes in Computer Science (including subseries Lecture Notes
in Artificial Intelligence and Lecture Notes in Bioinformatics)
publication_status: published
publisher: Springer
publist_id: '5005'
quality_controlled: '1'
scopus_import: 1
status: public
title: Policy-based signatures
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 8383
year: '2014'
...
---
_id: '2050'
abstract:
- lang: eng
text: The flow instability and further transition to turbulence in a toroidal pipe
(torus) with curvature ratio (tube-to-coiling diameter) 0.049 is investigated
experimentally. The flow inside the toroidal pipe is driven by a steel sphere
fitted to the inner pipe diameter. The sphere is moved with constant azimuthal
velocity from outside the torus by a moving magnet. The experiment is designed
to investigate curved pipe flow by optical measurement techniques. Using stereoscopic
particle image velocimetry, laser Doppler velocimetry and pressure drop measurements,
the flow is measured for Reynolds numbers ranging from 1000 to 15 000. Time- and
space-resolved velocity fields are obtained and analysed. The steady axisymmetric
basic flow is strongly influenced by centrifugal effects. On an increase of the
Reynolds number we find a sequence of bifurcations. For Re=4075±2% a supercritical
bifurcation to an oscillatory flow is found in which waves travel in the streamwise
direction with a phase velocity slightly faster than the mean flow. The oscillatory
flow is superseded by a presumably quasi-periodic flow at a further increase of
the Reynolds number before turbulence sets in. The results are found to be compatible,
in general, with earlier experimental and numerical investigations on transition
to turbulence in helical and curved pipes. However, important aspects of the bifurcation
scenario differ considerably.
article_processing_charge: No
author:
- first_name: Jakob
full_name: Kühnen, Jakob
id: 3A47AE32-F248-11E8-B48F-1D18A9856A87
last_name: Kühnen
orcid: 0000-0003-4312-0179
- first_name: Markus
full_name: Holzner, Markus
last_name: Holzner
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
- first_name: Hendrik
full_name: Kuhlmann, Hendrik
last_name: Kuhlmann
citation:
ama: Kühnen J, Holzner M, Hof B, Kuhlmann H. Experimental investigation of transitional
flow in a toroidal pipe. Journal of Fluid Mechanics. 2014;738:463-491.
doi:10.1017/jfm.2013.603
apa: Kühnen, J., Holzner, M., Hof, B., & Kuhlmann, H. (2014). Experimental investigation
of transitional flow in a toroidal pipe. Journal of Fluid Mechanics. Cambridge
University Press. https://doi.org/10.1017/jfm.2013.603
chicago: Kühnen, Jakob, Markus Holzner, Björn Hof, and Hendrik Kuhlmann. “Experimental
Investigation of Transitional Flow in a Toroidal Pipe.” Journal of Fluid Mechanics.
Cambridge University Press, 2014. https://doi.org/10.1017/jfm.2013.603.
ieee: J. Kühnen, M. Holzner, B. Hof, and H. Kuhlmann, “Experimental investigation
of transitional flow in a toroidal pipe,” Journal of Fluid Mechanics, vol.
738. Cambridge University Press, pp. 463–491, 2014.
ista: Kühnen J, Holzner M, Hof B, Kuhlmann H. 2014. Experimental investigation of
transitional flow in a toroidal pipe. Journal of Fluid Mechanics. 738, 463–491.
mla: Kühnen, Jakob, et al. “Experimental Investigation of Transitional Flow in a
Toroidal Pipe.” Journal of Fluid Mechanics, vol. 738, Cambridge University
Press, 2014, pp. 463–91, doi:10.1017/jfm.2013.603.
short: J. Kühnen, M. Holzner, B. Hof, H. Kuhlmann, Journal of Fluid Mechanics 738
(2014) 463–491.
date_created: 2018-12-11T11:55:25Z
date_published: 2014-01-10T00:00:00Z
date_updated: 2021-01-12T06:54:59Z
day: '10'
department:
- _id: BjHo
doi: 10.1017/jfm.2013.603
external_id:
arxiv:
- '1508.06546'
intvolume: ' 738'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1508.06546
month: '01'
oa: 1
oa_version: Submitted Version
page: 463 - 491
publication: Journal of Fluid Mechanics
publication_status: published
publisher: Cambridge University Press
publist_id: '5001'
quality_controlled: '1'
scopus_import: 1
status: public
title: Experimental investigation of transitional flow in a toroidal pipe
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 738
year: '2014'
...
---
_id: '2051'
abstract:
- lang: eng
text: We show that the usual score function for conditional Markov networks can
be written as the expectation over the scores of their spanning trees. We also
show that a small random sample of these output trees can attain a significant
fraction of the margin obtained by the complete graph and we provide conditions
under which we can perform tractable inference. The experimental results confirm
that practical learning is scalable to realistic datasets using this approach.
author:
- first_name: Mario
full_name: Marchand, Mario
last_name: Marchand
- first_name: Su
full_name: Hongyu, Su
last_name: Hongyu
- first_name: Emilie
full_name: Emilie Morvant
id: 4BAC2A72-F248-11E8-B48F-1D18A9856A87
last_name: Morvant
orcid: 0000-0002-8301-7240
- first_name: Juho
full_name: Rousu, Juho
last_name: Rousu
- first_name: John
full_name: Shawe-Taylor, John
last_name: Shawe Taylor
citation:
ama: 'Marchand M, Hongyu S, Morvant E, Rousu J, Shawe Taylor J. Multilabel structured
output learning with random spanning trees of max-margin Markov networks. In:
Neural Information Processing Systems; 2014.'
apa: 'Marchand, M., Hongyu, S., Morvant, E., Rousu, J., & Shawe Taylor, J. (2014).
Multilabel structured output learning with random spanning trees of max-margin
Markov networks. Presented at the NIPS: Neural Information Processing Systems,
Neural Information Processing Systems.'
chicago: Marchand, Mario, Su Hongyu, Emilie Morvant, Juho Rousu, and John Shawe
Taylor. “Multilabel Structured Output Learning with Random Spanning Trees of Max-Margin
Markov Networks.” Neural Information Processing Systems, 2014.
ieee: 'M. Marchand, S. Hongyu, E. Morvant, J. Rousu, and J. Shawe Taylor, “Multilabel
structured output learning with random spanning trees of max-margin Markov networks,”
presented at the NIPS: Neural Information Processing Systems, 2014.'
ista: 'Marchand M, Hongyu S, Morvant E, Rousu J, Shawe Taylor J. 2014. Multilabel
structured output learning with random spanning trees of max-margin Markov networks.
NIPS: Neural Information Processing Systems.'
mla: Marchand, Mario, et al. Multilabel Structured Output Learning with Random
Spanning Trees of Max-Margin Markov Networks. Neural Information Processing
Systems, 2014.
short: M. Marchand, S. Hongyu, E. Morvant, J. Rousu, J. Shawe Taylor, in:, Neural
Information Processing Systems, 2014.
conference:
name: 'NIPS: Neural Information Processing Systems'
date_created: 2018-12-11T11:55:26Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:54:59Z
day: '01'
extern: 1
main_file_link:
- open_access: '1'
url: https://hal.archives-ouvertes.fr/hal-01065586
month: '01'
oa: 1
publication_status: published
publisher: Neural Information Processing Systems
publist_id: '4996'
quality_controlled: 0
status: public
title: Multilabel structured output learning with random spanning trees of max-margin
Markov networks
type: conference
year: '2014'
...
---
_id: '2059'
abstract:
- lang: eng
text: Plant embryogenesis is regulated by differential distribution of the plant
hormone auxin. However, the cells establishing these gradients during microspore
embryogenesis remain to be identified. For the first time, we describe, using
the DR5 or DR5rev reporter gene systems, the GFP- and GUS-based auxin biosensors
to monitor auxin during Brassica napus androgenesis at cellular resolution in
the initial stages. Our study provides evidence that the distribution of auxin
changes during embryo development and depends on the temperature-inducible in
vitro culture conditions. For this, microspores (mcs) were induced to embryogenesis
by heat treatment and then subjected to genetic modification via Agrobacterium
tumefaciens. The duration of high temperature treatment had a significant influence
on auxin distribution in isolated and in vitro-cultured microspores and on microspore-derived
embryo development. In the “mild” heat-treated (1 day at 32 °C) mcs, auxin localized
in a polar way already at the uni-nucleate microspore, which was critical for
the initiation of embryos with suspensor-like structure. Assuming a mean mcs radius
of 20 μm, endogenous auxin content in a single cell corresponded to concentration
of 1.01 μM. In mcs subjected to a prolonged heat (5 days at 32 °C), although auxin
concentration increased dozen times, auxin polarization was set up at a few-celled
pro-embryos without suspensor. Those embryos were enclosed in the outer wall called
the exine. The exine rupture was accompanied by the auxin gradient polarization.
Relative quantitative estimation of auxin, using time-lapse imaging, revealed
that primordia possess up to 1.3-fold higher amounts than those found in the root
apices of transgenic MDEs in the presence of exogenous auxin. Our results show,
for the first time, which concentration of endogenous auxin coincides with the
first cell division and how the high temperature interplays with auxin, by what
affects delay early establishing microspore polarity. Moreover, we present how
the local auxin accumulation demonstrates the apical–basal axis formation of the
androgenic embryo and directs the axiality of the adult haploid plant.
acknowledgement: The research was supported by the IPP PAS-IPGB SAS bilateral project
(“Molecular analysis of auxin distribution in oilseed androgenic embryos”), IPP
PAS-FWO VIB bilateral project (“Auxin as signaling molecule in doubled haploid production
of rape (B. napus var. oleifera)”), individual national research project 2011/01/D/NZ9/02547,
and VEGA 2-0090-14.
author:
- first_name: Ewa
full_name: Dubas, Ewa
last_name: Dubas
- first_name: Jana
full_name: Moravčíková, Jana
last_name: Moravčíková
- first_name: Jana
full_name: Libantová, Jana
last_name: Libantová
- first_name: Ildikó
full_name: Matušíková, Ildikó
last_name: Matušíková
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
- first_name: Iwona
full_name: Zur, Iwona
last_name: Zur
- first_name: Monika
full_name: Krzewska, Monika
last_name: Krzewska
citation:
ama: Dubas E, Moravčíková J, Libantová J, et al. The influence of heat stress on
auxin distribution in transgenic B napus microspores and microspore derived embryos.
Protoplasma. 2014;251(5):1077-1087. doi:10.1007/s00709-014-0616-1
apa: Dubas, E., Moravčíková, J., Libantová, J., Matušíková, I., Benková, E., Zur,
I., & Krzewska, M. (2014). The influence of heat stress on auxin distribution
in transgenic B napus microspores and microspore derived embryos. Protoplasma.
Springer. https://doi.org/10.1007/s00709-014-0616-1
chicago: Dubas, Ewa, Jana Moravčíková, Jana Libantová, Ildikó Matušíková, Eva Benková,
Iwona Zur, and Monika Krzewska. “The Influence of Heat Stress on Auxin Distribution
in Transgenic B Napus Microspores and Microspore Derived Embryos.” Protoplasma.
Springer, 2014. https://doi.org/10.1007/s00709-014-0616-1.
ieee: E. Dubas et al., “The influence of heat stress on auxin distribution
in transgenic B napus microspores and microspore derived embryos,” Protoplasma,
vol. 251, no. 5. Springer, pp. 1077–1087, 2014.
ista: Dubas E, Moravčíková J, Libantová J, Matušíková I, Benková E, Zur I, Krzewska
M. 2014. The influence of heat stress on auxin distribution in transgenic B napus
microspores and microspore derived embryos. Protoplasma. 251(5), 1077–1087.
mla: Dubas, Ewa, et al. “The Influence of Heat Stress on Auxin Distribution in Transgenic
B Napus Microspores and Microspore Derived Embryos.” Protoplasma, vol.
251, no. 5, Springer, 2014, pp. 1077–87, doi:10.1007/s00709-014-0616-1.
short: E. Dubas, J. Moravčíková, J. Libantová, I. Matušíková, E. Benková, I. Zur,
M. Krzewska, Protoplasma 251 (2014) 1077–1087.
date_created: 2018-12-11T11:55:29Z
date_published: 2014-02-20T00:00:00Z
date_updated: 2021-01-12T06:55:02Z
day: '20'
ddc:
- '580'
department:
- _id: EvBe
doi: 10.1007/s00709-014-0616-1
file:
- access_level: open_access
checksum: d570a6073765118fc0bb83c31d96fa53
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:31Z
date_updated: 2020-07-14T12:45:27Z
file_id: '5353'
file_name: IST-2015-394-v1+1_s00709-014-0616-1.pdf
file_size: 6377990
relation: main_file
file_date_updated: 2020-07-14T12:45:27Z
has_accepted_license: '1'
intvolume: ' 251'
issue: '5'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 1077 - 1087
publication: Protoplasma
publication_status: published
publisher: Springer
publist_id: '4987'
pubrep_id: '394'
quality_controlled: '1'
scopus_import: 1
status: public
title: The influence of heat stress on auxin distribution in transgenic B napus microspores
and microspore derived embryos
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: 251
year: '2014'
...
---
_id: '2062'
abstract:
- lang: eng
text: The success story of fast-spiking, parvalbumin-positive (PV+) GABAergic interneurons
(GABA, γ-aminobutyric acid) in the mammalian central nervous system is noteworthy.
In 1995, the properties of these interneurons were completely unknown. Twenty
years later, thanks to the massive use of subcellular patch-clamp techniques,
simultaneous multiple-cell recording, optogenetics, in vivo measurements, and
computational approaches, our knowledge about PV+ interneurons became more extensive
than for several types of pyramidal neurons. These findings have implications
beyond the “small world” of basic research on GABAergic cells. For example, the
results provide a first proof of principle that neuroscientists might be able
to close the gaps between the molecular, cellular, network, and behavioral levels,
representing one of the main challenges at the present time. Furthermore, the
results may form the basis for PV+ interneurons as therapeutic targets for brain
disease in the future. However, much needs to be learned about the basic function
of these interneurons before clinical neuroscientists will be able to use PV+
interneurons for therapeutic purposes.
article_number: '1255263'
author:
- first_name: Hua
full_name: Hu, Hua
id: 4AC0145C-F248-11E8-B48F-1D18A9856A87
last_name: Hu
- first_name: Jian
full_name: Gan, Jian
id: 3614E438-F248-11E8-B48F-1D18A9856A87
last_name: Gan
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: 'Hu H, Gan J, Jonas PM. Fast-spiking parvalbumin^+ GABAergic interneurons:
From cellular design to microcircuit function. Science. 2014;345(6196).
doi:10.1126/science.1255263'
apa: 'Hu, H., Gan, J., & Jonas, P. M. (2014). Fast-spiking parvalbumin^+ GABAergic
interneurons: From cellular design to microcircuit function. Science. American
Association for the Advancement of Science. https://doi.org/10.1126/science.1255263'
chicago: 'Hu, Hua, Jian Gan, and Peter M Jonas. “Fast-Spiking Parvalbumin^+ GABAergic
Interneurons: From Cellular Design to Microcircuit Function.” Science.
American Association for the Advancement of Science, 2014. https://doi.org/10.1126/science.1255263.'
ieee: 'H. Hu, J. Gan, and P. M. Jonas, “Fast-spiking parvalbumin^+ GABAergic interneurons:
From cellular design to microcircuit function,” Science, vol. 345, no.
6196. American Association for the Advancement of Science, 2014.'
ista: 'Hu H, Gan J, Jonas PM. 2014. Fast-spiking parvalbumin^+ GABAergic interneurons:
From cellular design to microcircuit function. Science. 345(6196), 1255263.'
mla: 'Hu, Hua, et al. “Fast-Spiking Parvalbumin^+ GABAergic Interneurons: From Cellular
Design to Microcircuit Function.” Science, vol. 345, no. 6196, 1255263,
American Association for the Advancement of Science, 2014, doi:10.1126/science.1255263.'
short: H. Hu, J. Gan, P.M. Jonas, Science 345 (2014).
date_created: 2018-12-11T11:55:29Z
date_published: 2014-08-01T00:00:00Z
date_updated: 2021-01-12T06:55:03Z
day: '01'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1126/science.1255263
ec_funded: 1
file:
- access_level: open_access
checksum: a0036a589037d37e86364fa25cc0a82f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:00Z
date_updated: 2020-07-14T12:45:27Z
file_id: '5185'
file_name: IST-2017-821-v1+1_1255263JonasPVReviewTextR_Final.pdf
file_size: 215514
relation: main_file
- access_level: open_access
checksum: e1f57d2713725449cb898fdcb8ef47b8
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:01Z
date_updated: 2020-07-14T12:45:27Z
file_id: '5186'
file_name: IST-2017-821-v1+2_1255263JonasPVReviewFigures_Final.pdf
file_size: 1732723
relation: main_file
file_date_updated: 2020-07-14T12:45:27Z
has_accepted_license: '1'
intvolume: ' 345'
issue: '6196'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
project:
- _id: 25C26B1E-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P24909-B24
name: Mechanisms of transmitter release at GABAergic synapses
- _id: 25C0F108-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '268548'
name: Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons
publication: Science
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '4984'
pubrep_id: '821'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Fast-spiking parvalbumin^+ GABAergic interneurons: From cellular design to
microcircuit function'
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 345
year: '2014'
...
---
_id: '2058'
abstract:
- lang: eng
text: We present a method for smoothly blending between existing liquid animations.
We introduce a semi-automatic method for matching two existing liquid animations,
which we use to create new fluid motion that plausibly interpolates the input.
Our contributions include a new space-time non-rigid iterative closest point algorithm
that incorporates user guidance, a subsampling technique for efficient registration
of meshes with millions of vertices, and a fast surface extraction algorithm that
produces 3D triangle meshes from a 4D space-time surface. Our technique can be
used to instantly create hundreds of new simulations, or to interactively explore
complex parameter spaces. Our method is guaranteed to produce output that does
not deviate from the input animations, and it generalizes to multiple dimensions.
Because our method runs at interactive rates after the initial precomputation
step, it has potential applications in games and training simulations.
article_number: '137'
article_processing_charge: No
author:
- first_name: Karthik
full_name: Raveendran, Karthik
last_name: Raveendran
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
- first_name: Nils
full_name: Thuerey, Nils
last_name: Thuerey
- first_name: Greg
full_name: Türk, Greg
last_name: Türk
citation:
ama: 'Raveendran K, Wojtan C, Thuerey N, Türk G. Blending liquids. In: ACM Transactions
on Graphics. Vol 33. ACM; 2014. doi:10.1145/2601097.2601126'
apa: 'Raveendran, K., Wojtan, C., Thuerey, N., & Türk, G. (2014). Blending liquids.
In ACM Transactions on Graphics (Vol. 33). Vancouver, Canada: ACM. https://doi.org/10.1145/2601097.2601126'
chicago: Raveendran, Karthik, Chris Wojtan, Nils Thuerey, and Greg Türk. “Blending
Liquids.” In ACM Transactions on Graphics, Vol. 33. ACM, 2014. https://doi.org/10.1145/2601097.2601126.
ieee: K. Raveendran, C. Wojtan, N. Thuerey, and G. Türk, “Blending liquids,” in
ACM Transactions on Graphics, Vancouver, Canada, 2014, vol. 33, no. 4.
ista: 'Raveendran K, Wojtan C, Thuerey N, Türk G. 2014. Blending liquids. ACM Transactions
on Graphics. SIGGRAPH: International Conference and Exhibition on Computer Graphics
and Interactive Techniques vol. 33, 137.'
mla: Raveendran, Karthik, et al. “Blending Liquids.” ACM Transactions on Graphics,
vol. 33, no. 4, 137, ACM, 2014, doi:10.1145/2601097.2601126.
short: K. Raveendran, C. Wojtan, N. Thuerey, G. Türk, in:, ACM Transactions on Graphics,
ACM, 2014.
conference:
end_date: 2014-08-14
location: Vancouver, Canada
name: 'SIGGRAPH: International Conference and Exhibition on Computer Graphics and
Interactive Techniques'
start_date: 2014-08-10
date_created: 2018-12-11T11:55:28Z
date_published: 2014-07-01T00:00:00Z
date_updated: 2022-08-25T14:02:46Z
day: '01'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/2601097.2601126
file:
- access_level: open_access
checksum: 1752760a2e71e254537f31c0d10d9c6c
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:27Z
date_updated: 2020-07-14T12:45:27Z
file_id: '4688'
file_name: IST-2016-606-v1+1_BlendingLiquids-Preprint.pdf
file_size: 8387384
relation: main_file
file_date_updated: 2020-07-14T12:45:27Z
has_accepted_license: '1'
intvolume: ' 33'
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: 25636330-B435-11E9-9278-68D0E5697425
grant_number: 11-NSF-1070
name: ROOTS Genome-wide Analysis of Root Traits
publication: ACM Transactions on Graphics
publication_status: published
publisher: ACM
publist_id: '4988'
pubrep_id: '606'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Blending liquids
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '2014'
...
---
_id: '2057'
abstract:
- lang: eng
text: 'In the past few years, a lot of attention has been devoted to multimedia
indexing by fusing multimodal informations. Two kinds of fusion schemes are generally
considered: The early fusion and the late fusion. We focus on late classifier
fusion, where one combines the scores of each modality at the decision level.
To tackle this problem, we investigate a recent and elegant well-founded quadratic
program named MinCq coming from the machine learning PAC-Bayesian theory. MinCq
looks for the weighted combination, over a set of real-valued functions seen as
voters, leading to the lowest misclassification rate, while maximizing the voters’
diversity. We propose an extension of MinCq tailored to multimedia indexing. Our
method is based on an order-preserving pairwise loss adapted to ranking that allows
us to improve Mean Averaged Precision measure while taking into account the diversity
of the voters that we want to fuse. We provide evidence that this method is naturally
adapted to late fusion procedures and confirm the good behavior of our approach
on the challenging PASCAL VOC’07 benchmark.'
alternative_title:
- LNCS
author:
- first_name: Emilie
full_name: Morvant, Emilie
id: 4BAC2A72-F248-11E8-B48F-1D18A9856A87
last_name: Morvant
orcid: 0000-0002-8301-7240
- first_name: Amaury
full_name: Habrard, Amaury
last_name: Habrard
- first_name: Stéphane
full_name: Ayache, Stéphane
last_name: Ayache
citation:
ama: 'Morvant E, Habrard A, Ayache S. Majority vote of diverse classifiers for late
fusion. In: Lecture Notes in Computer Science (Including Subseries Lecture
Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol
8621. Springer; 2014:153-162. doi:10.1007/978-3-662-44415-3_16'
apa: 'Morvant, E., Habrard, A., & Ayache, S. (2014). Majority vote of diverse
classifiers for late fusion. In Lecture Notes in Computer Science (including
subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
(Vol. 8621, pp. 153–162). Joensuu, Finland: Springer. https://doi.org/10.1007/978-3-662-44415-3_16'
chicago: Morvant, Emilie, Amaury Habrard, and Stéphane Ayache. “Majority Vote of
Diverse Classifiers for Late Fusion.” In Lecture Notes in Computer Science
(Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes
in Bioinformatics), 8621:153–62. Springer, 2014. https://doi.org/10.1007/978-3-662-44415-3_16.
ieee: E. Morvant, A. Habrard, and S. Ayache, “Majority vote of diverse classifiers
for late fusion,” in Lecture Notes in Computer Science (including subseries
Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
Joensuu, Finland, 2014, vol. 8621, pp. 153–162.
ista: 'Morvant E, Habrard A, Ayache S. 2014. Majority vote of diverse classifiers
for late fusion. Lecture Notes in Computer Science (including subseries Lecture
Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). IAPR: International
Workshop on Structural, Syntactic, and Statistical Pattern Recognition, LNCS,
vol. 8621, 153–162.'
mla: Morvant, Emilie, et al. “Majority Vote of Diverse Classifiers for Late Fusion.”
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics), vol. 8621, Springer, 2014,
pp. 153–62, doi:10.1007/978-3-662-44415-3_16.
short: E. Morvant, A. Habrard, S. Ayache, in:, Lecture Notes in Computer Science
(Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes
in Bioinformatics), Springer, 2014, pp. 153–162.
conference:
end_date: 2014-08-22
location: Joensuu, Finland
name: 'IAPR: International Workshop on Structural, Syntactic, and Statistical Pattern
Recognition'
start_date: 2014-08-20
date_created: 2018-12-11T11:55:28Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:55:01Z
day: '01'
department:
- _id: ChLa
doi: 10.1007/978-3-662-44415-3_16
ec_funded: 1
external_id:
arxiv:
- '1404.7796'
intvolume: ' 8621'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1404.7796
month: '01'
oa: 1
oa_version: Preprint
page: 153 - 162
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication: Lecture Notes in Computer Science (including subseries Lecture Notes
in Artificial Intelligence and Lecture Notes in Bioinformatics)
publication_status: published
publisher: Springer
publist_id: '4989'
quality_controlled: '1'
scopus_import: 1
status: public
title: Majority vote of diverse classifiers for late fusion
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8621
year: '2014'
...
---
_id: '2056'
abstract:
- lang: eng
text: 'We consider a continuous-time Markov chain (CTMC) whose state space is partitioned
into aggregates, and each aggregate is assigned a probability measure. A sufficient
condition for defining a CTMC over the aggregates is presented as a variant of
weak lumpability, which also characterizes that the measure over the original
process can be recovered from that of the aggregated one. We show how the applicability
of de-aggregation depends on the initial distribution. The application section
is devoted to illustrate how the developed theory aids in reducing CTMC models
of biochemical systems particularly in connection to protein-protein interactions.
We assume that the model is written by a biologist in form of site-graph-rewrite
rules. Site-graph-rewrite rules compactly express that, often, only a local context
of a protein (instead of a full molecular species) needs to be in a certain configuration
in order to trigger a reaction event. This observation leads to suitable aggregate
Markov chains with smaller state spaces, thereby providing sufficient reduction
in computational complexity. This is further exemplified in two case studies:
simple unbounded polymerization and early EGFR/insulin crosstalk.'
acknowledgement: T. Petrov is supported by SystemsX.ch—the Swiss Inititative for Systems
Biology.
author:
- first_name: Arnab
full_name: Ganguly, Arnab
last_name: Ganguly
- first_name: Tatjana
full_name: Petrov, Tatjana
id: 3D5811FC-F248-11E8-B48F-1D18A9856A87
last_name: Petrov
orcid: 0000-0002-9041-0905
- first_name: Heinz
full_name: Koeppl, Heinz
last_name: Koeppl
citation:
ama: Ganguly A, Petrov T, Koeppl H. Markov chain aggregation and its applications
to combinatorial reaction networks. Journal of Mathematical Biology. 2014;69(3):767-797.
doi:10.1007/s00285-013-0738-7
apa: Ganguly, A., Petrov, T., & Koeppl, H. (2014). Markov chain aggregation
and its applications to combinatorial reaction networks. Journal of Mathematical
Biology. Springer. https://doi.org/10.1007/s00285-013-0738-7
chicago: Ganguly, Arnab, Tatjana Petrov, and Heinz Koeppl. “Markov Chain Aggregation
and Its Applications to Combinatorial Reaction Networks.” Journal of Mathematical
Biology. Springer, 2014. https://doi.org/10.1007/s00285-013-0738-7.
ieee: A. Ganguly, T. Petrov, and H. Koeppl, “Markov chain aggregation and its applications
to combinatorial reaction networks,” Journal of Mathematical Biology, vol.
69, no. 3. Springer, pp. 767–797, 2014.
ista: Ganguly A, Petrov T, Koeppl H. 2014. Markov chain aggregation and its applications
to combinatorial reaction networks. Journal of Mathematical Biology. 69(3), 767–797.
mla: Ganguly, Arnab, et al. “Markov Chain Aggregation and Its Applications to Combinatorial
Reaction Networks.” Journal of Mathematical Biology, vol. 69, no. 3, Springer,
2014, pp. 767–97, doi:10.1007/s00285-013-0738-7.
short: A. Ganguly, T. Petrov, H. Koeppl, Journal of Mathematical Biology 69 (2014)
767–797.
date_created: 2018-12-11T11:55:28Z
date_published: 2014-11-20T00:00:00Z
date_updated: 2021-01-12T06:55:01Z
day: '20'
department:
- _id: CaGu
- _id: ToHe
doi: 10.1007/s00285-013-0738-7
intvolume: ' 69'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1303.4532
month: '11'
oa: 1
oa_version: Submitted Version
page: 767 - 797
publication: Journal of Mathematical Biology
publication_status: published
publisher: Springer
publist_id: '4990'
quality_controlled: '1'
scopus_import: 1
status: public
title: Markov chain aggregation and its applications to combinatorial reaction networks
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 69
year: '2014'
...
---
_id: '2061'
abstract:
- lang: eng
text: 'Development of cambium and its activity is important for our knowledge of
the mechanism of secondary growth. Arabidopsis thaliana emerges as a good model
plant for such a kind of study. Thus, this paper reports on cellular events taking
place in the interfascicular regions of inflorescence stems of A. thaliana, leading
to the development of interfascicular cambium from differentiated interfascicular
parenchyma cells (IPC). These events are as follows: appearance of auxin accumulation,
PIN1 gene expression, polar PIN1 protein localization in the basal plasma membrane
and periclinal divisions. Distribution of auxin was observed to be higher in differentiating
into cambium parenchyma cells compared to cells within the pith and cortex. Expression
of PIN1 in IPC was always preceded by auxin accumulation. Basal localization of
PIN1 was already established in the cells prior to their periclinal division.
These cellular events initiated within parenchyma cells adjacent to the vascular
bundles and successively extended from that point towards the middle region of
the interfascicular area, located between neighboring vascular bundles. The final
consequence of which was the closure of the cambial ring within the stem. Changes
in the chemical composition of IPC walls were also detected and included changes
of pectic epitopes, xyloglucans (XG) and extensins rich in hydroxyproline (HRGPs).
In summary, results presented in this paper describe interfascicular cambium ontogenesis
in terms of successive cellular events in the interfascicular regions of inflorescence
stems of Arabidopsis.'
author:
- first_name: Ewa
full_name: Mazur, Ewa
last_name: Mazur
- first_name: Ewa
full_name: Kurczyñska, Ewa
last_name: Kurczyñska
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Mazur E, Kurczyñska E, Friml J. Cellular events during interfascicular cambium
ontogenesis in inflorescence stems of Arabidopsis. Protoplasma. 2014;251(5):1125-1139.
doi:10.1007/s00709-014-0620-5
apa: Mazur, E., Kurczyñska, E., & Friml, J. (2014). Cellular events during interfascicular
cambium ontogenesis in inflorescence stems of Arabidopsis. Protoplasma.
Springer. https://doi.org/10.1007/s00709-014-0620-5
chicago: Mazur, Ewa, Ewa Kurczyñska, and Jiří Friml. “Cellular Events during Interfascicular
Cambium Ontogenesis in Inflorescence Stems of Arabidopsis.” Protoplasma.
Springer, 2014. https://doi.org/10.1007/s00709-014-0620-5.
ieee: E. Mazur, E. Kurczyñska, and J. Friml, “Cellular events during interfascicular
cambium ontogenesis in inflorescence stems of Arabidopsis,” Protoplasma,
vol. 251, no. 5. Springer, pp. 1125–1139, 2014.
ista: Mazur E, Kurczyñska E, Friml J. 2014. Cellular events during interfascicular
cambium ontogenesis in inflorescence stems of Arabidopsis. Protoplasma. 251(5),
1125–1139.
mla: Mazur, Ewa, et al. “Cellular Events during Interfascicular Cambium Ontogenesis
in Inflorescence Stems of Arabidopsis.” Protoplasma, vol. 251, no. 5, Springer,
2014, pp. 1125–39, doi:10.1007/s00709-014-0620-5.
short: E. Mazur, E. Kurczyñska, J. Friml, Protoplasma 251 (2014) 1125–1139.
date_created: 2018-12-11T11:55:29Z
date_published: 2014-02-14T00:00:00Z
date_updated: 2021-01-12T06:55:03Z
day: '14'
department:
- _id: JiFr
doi: 10.1007/s00709-014-0620-5
intvolume: ' 251'
issue: '5'
language:
- iso: eng
month: '02'
oa_version: None
page: 1125 - 1139
publication: Protoplasma
publication_status: published
publisher: Springer
publist_id: '4985'
quality_controlled: '1'
scopus_import: 1
status: public
title: Cellular events during interfascicular cambium ontogenesis in inflorescence
stems of Arabidopsis
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 251
year: '2014'
...
---
_id: '2064'
abstract:
- lang: eng
text: We examined the synaptic structure, quantity, and distribution of α-amino-3-hydroxy-5-methylisoxazole-4-propionic
acid (AMPA)- and N-methyl-D-aspartate (NMDA)-type glutamate receptors (AMPARs
and NMDARs, respectively) in rat cochlear nuclei by a highly sensitive freeze-fracture
replica labeling technique. Four excitatory synapses formed by two distinct inputs,
auditory nerve (AN) and parallel fibers (PF), on different cell types were analyzed.
These excitatory synapse types included AN synapses on bushy cells (AN-BC synapses)
and fusiform cells (AN-FC synapses) and PF synapses on FC (PF-FC synapses) and
cartwheel cell spines (PF-CwC synapses). Immunogold labeling revealed differences
in synaptic structure as well as AMPAR and NMDAR number and/or density in both
AN and PF synapses, indicating a target-dependent organization. The immunogold
receptor labeling also identified differences in the synaptic organization of
FCs based on AN or PF connections, indicating an input-dependent organization
in FCs. Among the four excitatory synapse types, the AN-BC synapses were the smallest
and had the most densely packed intramembrane particles (IMPs), whereas the PF-CwC
synapses were the largest and had sparsely packed IMPs. All four synapse types
showed positive correlations between the IMP-cluster area and the AMPAR number,
indicating a common intrasynapse-type relationship for glutamatergic synapses.
Immunogold particles for AMPARs were distributed over the entire area of individual
AN synapses; PF synapses often showed synaptic areas devoid of labeling. The gold-labeling
for NMDARs occurred in a mosaic fashion, with less positive correlations between
the IMP-cluster area and the NMDAR number. Our observations reveal target- and
input-dependent features in the structure, number, and organization of AMPARs
and NMDARs in AN and PF synapses.
acknowledgement: "National Institutes of Health (NIH) Grant Number: 1R01DC013048‐0;
Biotechnology and Biological Sciences Research Council, UK Grant Number: BB/J015938/1\r\n"
author:
- first_name: Maía
full_name: Rubio, Maía
last_name: Rubio
- first_name: Yugo
full_name: Fukazawa, Yugo
last_name: Fukazawa
- first_name: Naomi
full_name: Kamasawa, Naomi
last_name: Kamasawa
- first_name: Cheryl
full_name: Clarkson, Cheryl
last_name: Clarkson
- first_name: Elek
full_name: Molnár, Elek
last_name: Molnár
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
citation:
ama: Rubio M, Fukazawa Y, Kamasawa N, Clarkson C, Molnár E, Shigemoto R. Target-
and input-dependent organization of AMPA and NMDA receptors in synaptic connections
of the cochlear nucleus. Journal of Comparative Neurology. 2014;522(18):4023-4042.
doi:10.1002/cne.23654
apa: Rubio, M., Fukazawa, Y., Kamasawa, N., Clarkson, C., Molnár, E., & Shigemoto,
R. (2014). Target- and input-dependent organization of AMPA and NMDA receptors
in synaptic connections of the cochlear nucleus. Journal of Comparative Neurology.
Wiley-Blackwell. https://doi.org/10.1002/cne.23654
chicago: Rubio, Maía, Yugo Fukazawa, Naomi Kamasawa, Cheryl Clarkson, Elek Molnár,
and Ryuichi Shigemoto. “Target- and Input-Dependent Organization of AMPA and NMDA
Receptors in Synaptic Connections of the Cochlear Nucleus.” Journal of Comparative
Neurology. Wiley-Blackwell, 2014. https://doi.org/10.1002/cne.23654.
ieee: M. Rubio, Y. Fukazawa, N. Kamasawa, C. Clarkson, E. Molnár, and R. Shigemoto,
“Target- and input-dependent organization of AMPA and NMDA receptors in synaptic
connections of the cochlear nucleus,” Journal of Comparative Neurology,
vol. 522, no. 18. Wiley-Blackwell, pp. 4023–4042, 2014.
ista: Rubio M, Fukazawa Y, Kamasawa N, Clarkson C, Molnár E, Shigemoto R. 2014.
Target- and input-dependent organization of AMPA and NMDA receptors in synaptic
connections of the cochlear nucleus. Journal of Comparative Neurology. 522(18),
4023–4042.
mla: Rubio, Maía, et al. “Target- and Input-Dependent Organization of AMPA and NMDA
Receptors in Synaptic Connections of the Cochlear Nucleus.” Journal of Comparative
Neurology, vol. 522, no. 18, Wiley-Blackwell, 2014, pp. 4023–42, doi:10.1002/cne.23654.
short: M. Rubio, Y. Fukazawa, N. Kamasawa, C. Clarkson, E. Molnár, R. Shigemoto,
Journal of Comparative Neurology 522 (2014) 4023–4042.
date_created: 2018-12-11T11:55:30Z
date_published: 2014-07-29T00:00:00Z
date_updated: 2021-01-12T06:55:05Z
day: '29'
department:
- _id: RySh
doi: 10.1002/cne.23654
intvolume: ' 522'
issue: '18'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4198489/
month: '07'
oa: 1
oa_version: Submitted Version
page: 4023 - 4042
publication: Journal of Comparative Neurology
publication_status: published
publisher: Wiley-Blackwell
publist_id: '4974'
quality_controlled: '1'
scopus_import: 1
status: public
title: Target- and input-dependent organization of AMPA and NMDA receptors in synaptic
connections of the cochlear nucleus
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 522
year: '2014'
...
---
_id: '2081'
abstract:
- lang: eng
text: We propose an interactive, optimization-in-the-loop tool for designing inflatable
structures. Given a target shape, the user draws a network of seams defining desired
segment boundaries in 3D. Our method computes optimally-shaped flat panels for
the segments, such that the inflated structure is as close as possible to the
target while satisfying the desired seam positions. Our approach is underpinned
by physics-based pattern optimization, accurate coarse-scale simulation using
tension field theory, and a specialized constraint-optimization method. Our system
is fast enough to warrant interactive exploration of different seam layouts, including
internal connections, and their effects on the inflated shape. We demonstrate
the resulting design process on a varied set of simulation examples, some of which
we have fabricated, demonstrating excellent agreement with the design intent.
acknowledgement: This work was partly funded by the NCCR Co-Me of the Swiss NSF.
article_number: '63'
author:
- first_name: Mélina
full_name: Skouras, Mélina
last_name: Skouras
- first_name: Bernhard
full_name: Thomaszewski, Bernhard
last_name: Thomaszewski
- first_name: Peter
full_name: Kaufmann, Peter
last_name: Kaufmann
- first_name: Akash
full_name: Garg, Akash
last_name: Garg
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Eitan
full_name: Grinspun, Eitan
last_name: Grinspun
- first_name: Markus
full_name: Gross, Markus
last_name: Gross
citation:
ama: 'Skouras M, Thomaszewski B, Kaufmann P, et al. Designing inflatable structures.
In: Vol 33. ACM; 2014. doi:10.1145/2601097.2601166'
apa: 'Skouras, M., Thomaszewski, B., Kaufmann, P., Garg, A., Bickel, B., Grinspun,
E., & Gross, M. (2014). Designing inflatable structures (Vol. 33). Presented
at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques,
ACM. https://doi.org/10.1145/2601097.2601166'
chicago: Skouras, Mélina, Bernhard Thomaszewski, Peter Kaufmann, Akash Garg, Bernd
Bickel, Eitan Grinspun, and Markus Gross. “Designing Inflatable Structures,” Vol.
33. ACM, 2014. https://doi.org/10.1145/2601097.2601166.
ieee: 'M. Skouras et al., “Designing inflatable structures,” presented at
the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques,
2014, vol. 33, no. 4.'
ista: 'Skouras M, Thomaszewski B, Kaufmann P, Garg A, Bickel B, Grinspun E, Gross
M. 2014. Designing inflatable structures. SIGGRAPH: Special Interest Group on
Computer Graphics and Interactive Techniques vol. 33, 63.'
mla: Skouras, Mélina, et al. Designing Inflatable Structures. Vol. 33, no.
4, 63, ACM, 2014, doi:10.1145/2601097.2601166.
short: M. Skouras, B. Thomaszewski, P. Kaufmann, A. Garg, B. Bickel, E. Grinspun,
M. Gross, in:, ACM, 2014.
conference:
name: 'SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques'
date_created: 2018-12-11T11:55:36Z
date_published: 2014-07-01T00:00:00Z
date_updated: 2021-01-12T06:55:11Z
day: '01'
doi: 10.1145/2601097.2601166
extern: '1'
intvolume: ' 33'
issue: '4'
language:
- iso: eng
month: '07'
oa_version: None
publication_status: published
publisher: ACM
publist_id: '4957'
status: public
title: Designing inflatable structures
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '2014'
...
---
_id: '2080'
abstract:
- lang: eng
text: 'Spinning tops and yo-yos have long fascinated cultures around the world with
their unexpected, graceful motions that seemingly elude gravity. We present an
algorithm to generate designs for spinning objects by optimizing rotational dynamics
properties. As input, the user provides a solid 3D model and a desired axis of
rotation. Our approach then modifies the mass distribution such that the principal
directions of the moment of inertia align with the target rotation frame. We augment
the model by creating voids inside its volume, with interior fill represented
by an adaptive multi-resolution vox-elization. The discrete voxel fill values
are optimized using a continuous, nonlinear formulation. Further, we optimize
for rotational stability by maximizing the dominant principal moment. We extend
our technique to incorporate deformation and multiple materials for cases where
internal voids alone are insufficient. Our method is well-suited for a variety
of 3D printed models, ranging from characters to abstract shapes. We demonstrate
tops and yo-yos that spin surprisingly stably despite their asymmetric appearance. '
acknowledgement: This project was supported in part by the ERC Starting Grant iModel
(StG-2012-306877). Emily Whiting is supported by the ETH Zurich / Marie Curie COFUND
Postdoctoral Fellowship.
author:
- first_name: Moritz
full_name: Bac̈her, Moritz
last_name: Bac̈Her
- first_name: Emily
full_name: Whiting, Emily
last_name: Whiting
- first_name: Bernd
full_name: Bernd Bickel
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Olga
full_name: Sorkine-Hornung, Olga
last_name: Sorkine Hornung
citation:
ama: 'Bac̈Her M, Whiting E, Bickel B, Sorkine Hornung O. Spin-It: Optimizing moment
of inertia for spinnable objects. In: Vol 33. ACM; 2014. doi:10.1145/2601097.2601157'
apa: 'Bac̈Her, M., Whiting, E., Bickel, B., & Sorkine Hornung, O. (2014). Spin-It:
Optimizing moment of inertia for spinnable objects (Vol. 33). Presented at the
SIGGRAPH: 41st International Conference and Exhibition on Computer Graphics and
Interactive Techniques, ACM. https://doi.org/10.1145/2601097.2601157'
chicago: 'Bac̈Her, Moritz, Emily Whiting, Bernd Bickel, and Olga Sorkine Hornung.
“Spin-It: Optimizing Moment of Inertia for Spinnable Objects,” Vol. 33. ACM, 2014.
https://doi.org/10.1145/2601097.2601157.'
ieee: 'M. Bac̈Her, E. Whiting, B. Bickel, and O. Sorkine Hornung, “Spin-It: Optimizing
moment of inertia for spinnable objects,” presented at the SIGGRAPH: 41st International
Conference and Exhibition on Computer Graphics and Interactive Techniques, 2014,
vol. 33, no. 4.'
ista: 'Bac̈Her M, Whiting E, Bickel B, Sorkine Hornung O. 2014. Spin-It: Optimizing
moment of inertia for spinnable objects. SIGGRAPH: 41st International Conference
and Exhibition on Computer Graphics and Interactive Techniques vol. 33.'
mla: 'Bac̈Her, Moritz, et al. Spin-It: Optimizing Moment of Inertia for Spinnable
Objects. Vol. 33, no. 4, ACM, 2014, doi:10.1145/2601097.2601157.'
short: M. Bac̈Her, E. Whiting, B. Bickel, O. Sorkine Hornung, in:, ACM, 2014.
conference:
name: 'SIGGRAPH: 41st International Conference and Exhibition on Computer Graphics
and Interactive Techniques'
date_created: 2018-12-11T11:55:35Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2019-04-26T07:22:07Z
day: '01'
doi: 10.1145/2601097.2601157
extern: 1
intvolume: ' 33'
issue: '4'
month: '01'
publication_status: published
publisher: ACM
publist_id: '4958'
quality_controlled: 0
status: public
title: 'Spin-It: Optimizing moment of inertia for spinnable objects'
type: conference
volume: 33
year: '2014'
...
---
_id: '2115'
abstract:
- lang: eng
text: The facial performance of an individual is inherently rich in subtle deformation
and timing details. Although these subtleties make the performance realistic and
compelling, they often elude both motion capture and hand animation. We present
a technique for adding fine-scale details and expressiveness to low-resolution
art-directed facial performances, such as those created manually using a rig,
via marker-based capture, by fitting a morphable model to a video, or through
Kinect reconstruction using recent faceshift technology. We employ a high-resolution
facial performance capture system to acquire a representative performance of an
individual in which he or she explores the full range of facial expressiveness.
From the captured data, our system extracts an expressiveness model that encodes
subtle spatial and temporal deformation details specific to that particular individual.
Once this model has been built, these details can be transferred to low-resolution
art-directed performances. We demonstrate results on various forms of input; after
our enhancement, the resulting animations exhibit the same nuances and fine spatial
details as the captured performance, with optional temporal enhancement to match
the dynamics of the actor. Finally, we show that our technique outperforms the
current state-of-the-art in example-based facial animation.
author:
- first_name: Amit
full_name: Bermano, Amit H
last_name: Bermano
- first_name: Derek
full_name: Bradley, Derek J
last_name: Bradley
- first_name: Thabo
full_name: Beeler, Thabo
last_name: Beeler
- first_name: Fabio
full_name: Zund, Fabio
last_name: Zund
- first_name: Derek
full_name: Nowrouzezahrai, Derek
last_name: Nowrouzezahrai
- first_name: Ilya
full_name: Baran, Ilya
last_name: Baran
- first_name: Olga
full_name: Sorkine-Hornung, Olga
last_name: Sorkine Hornung
- first_name: Hanspeter
full_name: Pfister, Hanspeter
last_name: Pfister
- first_name: Robert
full_name: Sumner, Robert W
last_name: Sumner
- first_name: Bernd
full_name: Bernd Bickel
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Markus
full_name: Groß, Markus S
last_name: Groß
citation:
ama: Bermano A, Bradley D, Beeler T, et al. Facial performance enhancement using
dynamic shape space analysis. ACM Transactions on Graphics. 2014;33(2).
doi:10.1145/2546276
apa: Bermano, A., Bradley, D., Beeler, T., Zund, F., Nowrouzezahrai, D., Baran,
I., … Groß, M. (2014). Facial performance enhancement using dynamic shape space
analysis. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/2546276
chicago: Bermano, Amit, Derek Bradley, Thabo Beeler, Fabio Zund, Derek Nowrouzezahrai,
Ilya Baran, Olga Sorkine Hornung, et al. “Facial Performance Enhancement Using
Dynamic Shape Space Analysis.” ACM Transactions on Graphics. ACM, 2014.
https://doi.org/10.1145/2546276.
ieee: A. Bermano et al., “Facial performance enhancement using dynamic shape
space analysis,” ACM Transactions on Graphics, vol. 33, no. 2. ACM, 2014.
ista: Bermano A, Bradley D, Beeler T, Zund F, Nowrouzezahrai D, Baran I, Sorkine
Hornung O, Pfister H, Sumner R, Bickel B, Groß M. 2014. Facial performance enhancement
using dynamic shape space analysis. ACM Transactions on Graphics. 33(2).
mla: Bermano, Amit, et al. “Facial Performance Enhancement Using Dynamic Shape Space
Analysis.” ACM Transactions on Graphics, vol. 33, no. 2, ACM, 2014, doi:10.1145/2546276.
short: A. Bermano, D. Bradley, T. Beeler, F. Zund, D. Nowrouzezahrai, I. Baran,
O. Sorkine Hornung, H. Pfister, R. Sumner, B. Bickel, M. Groß, ACM Transactions
on Graphics 33 (2014).
date_created: 2018-12-11T11:55:48Z
date_published: 2014-03-01T00:00:00Z
date_updated: 2021-01-12T06:55:24Z
day: '01'
doi: 10.1145/2546276
extern: 1
intvolume: ' 33'
issue: '2'
month: '03'
publication: ACM Transactions on Graphics
publication_status: published
publisher: ACM
publist_id: '4919'
quality_controlled: 0
status: public
title: Facial performance enhancement using dynamic shape space analysis
type: journal_article
volume: 33
year: '2014'
...
---
_id: '2133'
abstract:
- lang: eng
text: "Let ℭ denote the Clifford algebra over ℝ\U0001D45B, which is the von Neumann
algebra generated by n self-adjoint operators Q j , j = 1,…,n satisfying the canonical
anticommutation relations, Q i Q j + Q j Q i = 2δ ij I, and let τ denote the
normalized trace on ℭ. This algebra arises in quantum mechanics as the algebra
of observables generated by n fermionic degrees of freedom. Let \U0001D513 denote
the set of all positive operators \U0001D70C∈ℭ such that τ(ρ) = 1; these are the
non-commutative analogs of probability densities in the non-commutative probability
space (ℭ,\U0001D70F). The fermionic Fokker–Planck equation is a quantum-mechanical
analog of the classical Fokker–Planck equation with which it has much in common,
such as the same optimal hypercontractivity properties. In this paper we construct
a Riemannian metric on \U0001D513 that we show to be a natural analog of the classical
2-Wasserstein metric, and we show that, in analogy with the classical case, the
fermionic Fokker–Planck equation is gradient flow in this metric for the relative
entropy with respect to the ground state. We derive a number of consequences of
this, such as a sharp Talagrand inequality for this metric, and we prove a number
of results pertaining to this metric. Several open problems are raised."
author:
- first_name: Eric
full_name: Carlen, Eric
last_name: Carlen
- first_name: Jan
full_name: Maas, Jan
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
citation:
ama: Carlen E, Maas J. An analog of the 2-Wasserstein metric in non-commutative
probability under which the fermionic Fokker-Planck equation is gradient flow
for the entropy. Communications in Mathematical Physics. 2014;331(3):887-926.
doi:10.1007/s00220-014-2124-8
apa: Carlen, E., & Maas, J. (2014). An analog of the 2-Wasserstein metric in
non-commutative probability under which the fermionic Fokker-Planck equation is
gradient flow for the entropy. Communications in Mathematical Physics.
Springer. https://doi.org/10.1007/s00220-014-2124-8
chicago: Carlen, Eric, and Jan Maas. “An Analog of the 2-Wasserstein Metric in Non-Commutative
Probability under Which the Fermionic Fokker-Planck Equation Is Gradient Flow
for the Entropy.” Communications in Mathematical Physics. Springer, 2014.
https://doi.org/10.1007/s00220-014-2124-8.
ieee: E. Carlen and J. Maas, “An analog of the 2-Wasserstein metric in non-commutative
probability under which the fermionic Fokker-Planck equation is gradient flow
for the entropy,” Communications in Mathematical Physics, vol. 331, no.
3. Springer, pp. 887–926, 2014.
ista: Carlen E, Maas J. 2014. An analog of the 2-Wasserstein metric in non-commutative
probability under which the fermionic Fokker-Planck equation is gradient flow
for the entropy. Communications in Mathematical Physics. 331(3), 887–926.
mla: Carlen, Eric, and Jan Maas. “An Analog of the 2-Wasserstein Metric in Non-Commutative
Probability under Which the Fermionic Fokker-Planck Equation Is Gradient Flow
for the Entropy.” Communications in Mathematical Physics, vol. 331, no.
3, Springer, 2014, pp. 887–926, doi:10.1007/s00220-014-2124-8.
short: E. Carlen, J. Maas, Communications in Mathematical Physics 331 (2014) 887–926.
date_created: 2018-12-11T11:55:54Z
date_published: 2014-11-01T00:00:00Z
date_updated: 2021-01-12T06:55:30Z
day: '01'
doi: 10.1007/s00220-014-2124-8
extern: '1'
intvolume: ' 331'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: 'http://arxiv.org/abs/1203.5377 '
month: '11'
oa: 1
oa_version: Submitted Version
page: 887 - 926
publication: Communications in Mathematical Physics
publication_status: published
publisher: Springer
publist_id: '4901'
quality_controlled: '1'
status: public
title: An analog of the 2-Wasserstein metric in non-commutative probability under
which the fermionic Fokker-Planck equation is gradient flow for the entropy
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 331
year: '2014'
...
---
_id: '2131'
abstract:
- lang: eng
text: We study approximations to a class of vector-valued equations of Burgers type
driven by a multiplicative space-time white noise. A solution theory for this
class of equations has been developed recently in Probability Theory Related Fields
by Hairer and Weber. The key idea was to use the theory of controlled rough paths
to give definitions of weak/mild solutions and to set up a Picard iteration argument.
In this article the limiting behavior of a rather large class of (spatial) approximations
to these equations is studied. These approximations are shown to converge and
convergence rates are given, but the limit may depend on the particular choice
of approximation. This effect is a spatial analogue to the Itô-Stratonovich correction
in the theory of stochastic ordinary differential equations, where it is well
known that different approximation schemes may converge to different solutions.
acknowledgement: JM is supported by Rubicon grant 680-50-0901 of the Netherlands Organisation
for Scientific Research (NWO). MH is supported by EPSRC grant EP/D071593/1 and by
the Royal Society through a Wolfson Research Merit Award. Both MH and HW are supported
by the Le
author:
- first_name: Martin
full_name: Hairer, Martin M
last_name: Hairer
- first_name: Jan
full_name: Jan Maas
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
- first_name: Hendrik
full_name: Weber, Hendrik
last_name: Weber
citation:
ama: Hairer M, Maas J, Weber H. Approximating Rough Stochastic PDEs. Communications
on Pure and Applied Mathematics. 2014;67(5):776-870. doi:10.1002/cpa.21495
apa: Hairer, M., Maas, J., & Weber, H. (2014). Approximating Rough Stochastic
PDEs. Communications on Pure and Applied Mathematics. Wiley-Blackwell.
https://doi.org/10.1002/cpa.21495
chicago: Hairer, Martin, Jan Maas, and Hendrik Weber. “Approximating Rough Stochastic
PDEs.” Communications on Pure and Applied Mathematics. Wiley-Blackwell,
2014. https://doi.org/10.1002/cpa.21495.
ieee: M. Hairer, J. Maas, and H. Weber, “Approximating Rough Stochastic PDEs,” Communications
on Pure and Applied Mathematics, vol. 67, no. 5. Wiley-Blackwell, pp. 776–870,
2014.
ista: Hairer M, Maas J, Weber H. 2014. Approximating Rough Stochastic PDEs. Communications
on Pure and Applied Mathematics. 67(5), 776–870.
mla: Hairer, Martin, et al. “Approximating Rough Stochastic PDEs.” Communications
on Pure and Applied Mathematics, vol. 67, no. 5, Wiley-Blackwell, 2014, pp.
776–870, doi:10.1002/cpa.21495.
short: M. Hairer, J. Maas, H. Weber, Communications on Pure and Applied Mathematics
67 (2014) 776–870.
date_created: 2018-12-11T11:55:53Z
date_published: 2014-05-01T00:00:00Z
date_updated: 2021-01-12T06:55:30Z
day: '01'
doi: 10.1002/cpa.21495
extern: 1
intvolume: ' 67'
issue: '5'
main_file_link:
- open_access: '1'
url: 'http://arxiv.org/abs/1202.3094 '
month: '05'
oa: 1
page: 776 - 870
publication: Communications on Pure and Applied Mathematics
publication_status: published
publisher: Wiley-Blackwell
publist_id: '4902'
quality_controlled: 0
status: public
title: Approximating Rough Stochastic PDEs
type: journal_article
volume: 67
year: '2014'
...
---
_id: '2132'
abstract:
- lang: eng
text: We consider discrete porous medium equations of the form ∂tρt=Δϕ(ρt), where
Δ is the generator of a reversible continuous time Markov chain on a finite set
χ, and ϕ is an increasing function. We show that these equations arise as gradient
flows of certain entropy functionals with respect to suitable non-local transportation
metrics. This may be seen as a discrete analogue of the Wasserstein gradient flow
structure for porous medium equations in ℝn discovered by Otto. We present a one-dimensional
counterexample to geodesic convexity and discuss Gromov-Hausdorff convergence
to the Wasserstein metric.
author:
- first_name: Matthias
full_name: Erbar, Matthias
last_name: Erbar
- first_name: Jan
full_name: Jan Maas
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
citation:
ama: Erbar M, Maas J. Gradient flow structures for discrete porous medium equations.
Discrete and Continuous Dynamical Systems- Series A. 2014;34(4):1355-1374.
doi:10.3934/dcds.2014.34.1355
apa: Erbar, M., & Maas, J. (2014). Gradient flow structures for discrete porous
medium equations. Discrete and Continuous Dynamical Systems- Series A.
Southwest Missouri State University. https://doi.org/10.3934/dcds.2014.34.1355
chicago: Erbar, Matthias, and Jan Maas. “Gradient Flow Structures for Discrete Porous
Medium Equations.” Discrete and Continuous Dynamical Systems- Series A.
Southwest Missouri State University, 2014. https://doi.org/10.3934/dcds.2014.34.1355 .
ieee: M. Erbar and J. Maas, “Gradient flow structures for discrete porous medium
equations,” Discrete and Continuous Dynamical Systems- Series A, vol. 34,
no. 4. Southwest Missouri State University, pp. 1355–1374, 2014.
ista: Erbar M, Maas J. 2014. Gradient flow structures for discrete porous medium
equations. Discrete and Continuous Dynamical Systems- Series A. 34(4), 1355–1374.
mla: Erbar, Matthias, and Jan Maas. “Gradient Flow Structures for Discrete Porous
Medium Equations.” Discrete and Continuous Dynamical Systems- Series A,
vol. 34, no. 4, Southwest Missouri State University, 2014, pp. 1355–74, doi:10.3934/dcds.2014.34.1355
.
short: M. Erbar, J. Maas, Discrete and Continuous Dynamical Systems- Series A 34
(2014) 1355–1374.
date_created: 2018-12-11T11:55:54Z
date_published: 2014-04-01T00:00:00Z
date_updated: 2021-01-12T06:55:30Z
day: '01'
doi: '10.3934/dcds.2014.34.1355 '
extern: 1
intvolume: ' 34'
issue: '4'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1212.1129
month: '04'
oa: 1
page: 1355 - 1374
publication: Discrete and Continuous Dynamical Systems- Series A
publication_status: published
publisher: Southwest Missouri State University
publist_id: '4903'
quality_controlled: 0
status: public
title: Gradient flow structures for discrete porous medium equations
type: journal_article
volume: 34
year: '2014'
...
---
_id: '2140'
abstract:
- lang: eng
text: We propose a technique for engineering momentum-dependent dissipation in Bose-Einstein
condensates with non-local interactions. The scheme relies on the use of momentum-dependent
dark-states in close analogy to velocity-selective coherent population trapping.
During the short-time dissipative dynamics, the system is driven into a particular
finite-momentum phonon mode, which in real space corresponds to an ordered structure
with non-local density-density correlations. Dissipation-induced ordering can
be observed and studied in present-day experiments using cold atoms with dipole-dipole
or off-resonant Rydberg interactions. Due to its dissipative nature, the ordering
does not require artificial breaking of translational symmetry by an opticallattice
or harmonic trap. This opens up a perspective of direct cooling of quantum gases
into strongly-interacting phases.
acknowledgement: This work was supported by NSF through a grant for the Institute
for Theoretical Atomic, Molecular, and Optical Physics at Harvard University and
Smithsonian Astrophysical Observatory as well as the Harvard Quantum Optics Center.
article_number: '070401'
author:
- first_name: Johannes
full_name: Otterbach, Johannes
last_name: Otterbach
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: Otterbach J, Lemeshko M. Dissipative preparation of spatial order in Rydberg-dressed
Bose-Einstein condensates. Physical Review Letters. 2014;113(7). doi:10.1103/PhysRevLett.113.070401
apa: Otterbach, J., & Lemeshko, M. (2014). Dissipative preparation of spatial
order in Rydberg-dressed Bose-Einstein condensates. Physical Review Letters.
American Physical Society. https://doi.org/10.1103/PhysRevLett.113.070401
chicago: Otterbach, Johannes, and Mikhail Lemeshko. “Dissipative Preparation of
Spatial Order in Rydberg-Dressed Bose-Einstein Condensates.” Physical Review
Letters. American Physical Society, 2014. https://doi.org/10.1103/PhysRevLett.113.070401.
ieee: J. Otterbach and M. Lemeshko, “Dissipative preparation of spatial order in
Rydberg-dressed Bose-Einstein condensates,” Physical Review Letters, vol.
113, no. 7. American Physical Society, 2014.
ista: Otterbach J, Lemeshko M. 2014. Dissipative preparation of spatial order in
Rydberg-dressed Bose-Einstein condensates. Physical Review Letters. 113(7), 070401.
mla: Otterbach, Johannes, and Mikhail Lemeshko. “Dissipative Preparation of Spatial
Order in Rydberg-Dressed Bose-Einstein Condensates.” Physical Review Letters,
vol. 113, no. 7, 070401, American Physical Society, 2014, doi:10.1103/PhysRevLett.113.070401.
short: J. Otterbach, M. Lemeshko, Physical Review Letters 113 (2014).
date_created: 2018-12-11T11:55:56Z
date_published: 2014-08-11T00:00:00Z
date_updated: 2021-01-12T06:55:33Z
day: '11'
doi: 10.1103/PhysRevLett.113.070401
extern: '1'
intvolume: ' 113'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1308.5905
month: '08'
oa: 1
oa_version: Submitted Version
publication: Physical Review Letters
publication_status: published
publisher: American Physical Society
publist_id: '4884'
status: public
title: Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 113
year: '2014'
...
---
_id: '2153'
abstract:
- lang: eng
text: 'We define a simple, explicit map sending a morphism f : M → N of pointwise
finite dimensional persistence modules to a matching between the barcodes of M
and N. Our main result is that, in a precise sense, the quality of this matching
is tightly controlled by the lengths of the longest intervals in the barcodes
of ker f and coker f . As an immediate corollary, we obtain a new proof of the
algebraic stability theorem for persistence barcodes [5, 9], a fundamental result
in the theory of persistent homology. In contrast to previous proofs, ours shows
explicitly how a δ-interleaving morphism between two persistence modules induces
a δ-matching between the barcodes of the two modules. Our main result also specializes
to a structure theorem for submodules and quotients of persistence modules. Copyright
is held by the owner/author(s).'
author:
- first_name: Ulrich
full_name: Bauer, Ulrich
id: 2ADD483A-F248-11E8-B48F-1D18A9856A87
last_name: Bauer
orcid: 0000-0002-9683-0724
- first_name: Michael
full_name: Lesnick, Michael
last_name: Lesnick
citation:
ama: 'Bauer U, Lesnick M. Induced matchings of barcodes and the algebraic stability
of persistence. In: Proceedings of the Annual Symposium on Computational Geometry.
ACM; 2014:355-364. doi:10.1145/2582112.2582168'
apa: 'Bauer, U., & Lesnick, M. (2014). Induced matchings of barcodes and the
algebraic stability of persistence. In Proceedings of the Annual Symposium
on Computational Geometry (pp. 355–364). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582168'
chicago: Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and
the Algebraic Stability of Persistence.” In Proceedings of the Annual Symposium
on Computational Geometry, 355–64. ACM, 2014. https://doi.org/10.1145/2582112.2582168.
ieee: U. Bauer and M. Lesnick, “Induced matchings of barcodes and the algebraic
stability of persistence,” in Proceedings of the Annual Symposium on Computational
Geometry, Kyoto, Japan, 2014, pp. 355–364.
ista: 'Bauer U, Lesnick M. 2014. Induced matchings of barcodes and the algebraic
stability of persistence. Proceedings of the Annual Symposium on Computational
Geometry. SoCG: Symposium on Computational Geometry, 355–364.'
mla: Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and the
Algebraic Stability of Persistence.” Proceedings of the Annual Symposium on
Computational Geometry, ACM, 2014, pp. 355–64, doi:10.1145/2582112.2582168.
short: U. Bauer, M. Lesnick, in:, Proceedings of the Annual Symposium on Computational
Geometry, ACM, 2014, pp. 355–364.
conference:
end_date: 2014-06-11
location: Kyoto, Japan
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2014-06-08
date_created: 2018-12-11T11:56:01Z
date_published: 2014-06-01T00:00:00Z
date_updated: 2021-01-12T06:55:38Z
day: '01'
department:
- _id: HeEd
doi: 10.1145/2582112.2582168
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1311.3681
month: '06'
oa: 1
oa_version: Submitted Version
page: 355 - 364
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: Proceedings of the Annual Symposium on Computational Geometry
publication_status: published
publisher: ACM
publist_id: '4853'
quality_controlled: '1'
scopus_import: 1
status: public
title: Induced matchings of barcodes and the algebraic stability of persistence
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2154'
abstract:
- lang: eng
text: A result of Boros and Füredi (d = 2) and of Bárány (arbitrary d) asserts that
for every d there exists cd > 0 such that for every n-point set P ⊂ ℝd, some
point of ℝd is covered by at least (Formula presented.) of the d-simplices spanned
by the points of P. The largest possible value of cd has been the subject of ongoing
research. Recently Gromov improved the existing lower bounds considerably by introducing
a new, topological proof method. We provide an exposition of the combinatorial
component of Gromov's approach, in terms accessible to combinatorialists and discrete
geometers, and we investigate the limits of his method. In particular, we give
tighter bounds on the cofilling profiles for the (n - 1)-simplex. These bounds
yield a minor improvement over Gromov's lower bounds on cd for large d, but they
also show that the room for further improvement through the cofilling profiles
alone is quite small. We also prove a slightly better lower bound for c3 by an
approach using an additional structure besides the cofilling profiles. We formulate
a combinatorial extremal problem whose solution might perhaps lead to a tight
lower bound for cd.
acknowledgement: Swiss National Science Foundation (SNF 200021-125309, 200020-138230,
200020-12507)
author:
- first_name: Jiří
full_name: Matoušek, Jiří
last_name: Matoušek
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: Matoušek J, Wagner U. On Gromov’s method of selecting heavily covered points.
Discrete & Computational Geometry. 2014;52(1):1-33. doi:10.1007/s00454-014-9584-7
apa: Matoušek, J., & Wagner, U. (2014). On Gromov’s method of selecting heavily
covered points. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-014-9584-7
chicago: Matoušek, Jiří, and Uli Wagner. “On Gromov’s Method of Selecting Heavily
Covered Points.” Discrete & Computational Geometry. Springer, 2014.
https://doi.org/10.1007/s00454-014-9584-7.
ieee: J. Matoušek and U. Wagner, “On Gromov’s method of selecting heavily covered
points,” Discrete & Computational Geometry, vol. 52, no. 1. Springer,
pp. 1–33, 2014.
ista: Matoušek J, Wagner U. 2014. On Gromov’s method of selecting heavily covered
points. Discrete & Computational Geometry. 52(1), 1–33.
mla: Matoušek, Jiří, and Uli Wagner. “On Gromov’s Method of Selecting Heavily Covered
Points.” Discrete & Computational Geometry, vol. 52, no. 1, Springer,
2014, pp. 1–33, doi:10.1007/s00454-014-9584-7.
short: J. Matoušek, U. Wagner, Discrete & Computational Geometry 52 (2014) 1–33.
date_created: 2018-12-11T11:56:01Z
date_published: 2014-07-01T00:00:00Z
date_updated: 2021-01-12T06:55:38Z
day: '01'
department:
- _id: UlWa
doi: 10.1007/s00454-014-9584-7
intvolume: ' 52'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1102.3515
month: '07'
oa: 1
oa_version: Submitted Version
page: 1 - 33
project:
- _id: 25FA3206-B435-11E9-9278-68D0E5697425
grant_number: PP00P2_138948
name: 'Embeddings in Higher Dimensions: Algorithms and Combinatorics'
publication: Discrete & Computational Geometry
publication_status: published
publisher: Springer
publist_id: '4852'
quality_controlled: '1'
scopus_import: 1
status: public
title: On Gromov's method of selecting heavily covered points
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 52
year: '2014'
...
---
_id: '2156'
abstract:
- lang: eng
text: We propose a metric for Reeb graphs, called the functional distortion distance.
Under this distance, the Reeb graph is stable against small changes of input functions.
At the same time, it remains discriminative at differentiating input functions.
In particular, the main result is that the functional distortion distance between
two Reeb graphs is bounded from below by the bottleneck distance between both
the ordinary and extended persistence diagrams for appropriate dimensions. As
an application of our results, we analyze a natural simplification scheme for
Reeb graphs, and show that persistent features in Reeb graph remains persistent
under simplification. Understanding the stability of important features of the
Reeb graph under simplification is an interesting problem on its own right, and
critical to the practical usage of Reeb graphs. Copyright is held by the owner/author(s).
acknowledgement: National Science Foundation under grants CCF-1319406, CCF-1116258.
author:
- first_name: Ulrich
full_name: Bauer, Ulrich
id: 2ADD483A-F248-11E8-B48F-1D18A9856A87
last_name: Bauer
orcid: 0000-0002-9683-0724
- first_name: Xiaoyin
full_name: Ge, Xiaoyin
last_name: Ge
- first_name: Yusu
full_name: Wang, Yusu
last_name: Wang
citation:
ama: 'Bauer U, Ge X, Wang Y. Measuring distance between Reeb graphs. In: Proceedings
of the Annual Symposium on Computational Geometry. ACM; 2014:464-473. doi:10.1145/2582112.2582169'
apa: 'Bauer, U., Ge, X., & Wang, Y. (2014). Measuring distance between Reeb
graphs. In Proceedings of the Annual Symposium on Computational Geometry
(pp. 464–473). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582169'
chicago: Bauer, Ulrich, Xiaoyin Ge, and Yusu Wang. “Measuring Distance between Reeb
Graphs.” In Proceedings of the Annual Symposium on Computational Geometry,
464–73. ACM, 2014. https://doi.org/10.1145/2582112.2582169.
ieee: U. Bauer, X. Ge, and Y. Wang, “Measuring distance between Reeb graphs,” in
Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan,
2014, pp. 464–473.
ista: 'Bauer U, Ge X, Wang Y. 2014. Measuring distance between Reeb graphs. Proceedings
of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational
Geometry, 464–473.'
mla: Bauer, Ulrich, et al. “Measuring Distance between Reeb Graphs.” Proceedings
of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 464–73,
doi:10.1145/2582112.2582169.
short: U. Bauer, X. Ge, Y. Wang, in:, Proceedings of the Annual Symposium on Computational
Geometry, ACM, 2014, pp. 464–473.
conference:
end_date: 2014-06-11
location: Kyoto, Japan
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2014-06-08
date_created: 2018-12-11T11:56:02Z
date_published: 2014-06-01T00:00:00Z
date_updated: 2021-01-12T06:55:39Z
day: '01'
department:
- _id: HeEd
doi: 10.1145/2582112.2582169
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1307.2839
month: '06'
oa: 1
oa_version: Submitted Version
page: 464 - 473
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: Proceedings of the Annual Symposium on Computational Geometry
publication_status: published
publisher: ACM
publist_id: '4850'
quality_controlled: '1'
scopus_import: 1
status: public
title: Measuring distance between Reeb graphs
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2155'
abstract:
- lang: eng
text: Given a finite set of points in Rn and a positive radius, we study the Čech,
Delaunay-Čech, alpha, and wrap complexes as instances of a generalized discrete
Morse theory. We prove that the latter three complexes are simple-homotopy equivalent.
Our results have applications in topological data analysis and in the reconstruction
of shapes from sampled data. Copyright is held by the owner/author(s).
acknowledgement: This research is partially supported by ESF under the ACAT Research
Network Programme, and by the Russian Government under mega project 11.G34.31.0053
author:
- first_name: Ulrich
full_name: Bauer, Ulrich
id: 2ADD483A-F248-11E8-B48F-1D18A9856A87
last_name: Bauer
orcid: 0000-0002-9683-0724
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: 'Bauer U, Edelsbrunner H. The morse theory of Čech and Delaunay filtrations.
In: Proceedings of the Annual Symposium on Computational Geometry. ACM;
2014:484-490. doi:10.1145/2582112.2582167'
apa: 'Bauer, U., & Edelsbrunner, H. (2014). The morse theory of Čech and Delaunay
filtrations. In Proceedings of the Annual Symposium on Computational Geometry
(pp. 484–490). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582167'
chicago: Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and
Delaunay Filtrations.” In Proceedings of the Annual Symposium on Computational
Geometry, 484–90. ACM, 2014. https://doi.org/10.1145/2582112.2582167.
ieee: U. Bauer and H. Edelsbrunner, “The morse theory of Čech and Delaunay filtrations,”
in Proceedings of the Annual Symposium on Computational Geometry, Kyoto,
Japan, 2014, pp. 484–490.
ista: 'Bauer U, Edelsbrunner H. 2014. The morse theory of Čech and Delaunay filtrations.
Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium
on Computational Geometry, 484–490.'
mla: Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay
Filtrations.” Proceedings of the Annual Symposium on Computational Geometry,
ACM, 2014, pp. 484–90, doi:10.1145/2582112.2582167.
short: U. Bauer, H. Edelsbrunner, in:, Proceedings of the Annual Symposium on Computational
Geometry, ACM, 2014, pp. 484–490.
conference:
end_date: 2014-06-11
location: Kyoto, Japan
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2014-06-08
date_created: 2018-12-11T11:56:01Z
date_published: 2014-06-01T00:00:00Z
date_updated: 2021-01-12T06:55:38Z
day: '01'
department:
- _id: HeEd
doi: 10.1145/2582112.2582167
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1312.1231
month: '06'
oa: 1
oa_version: Submitted Version
page: 484 - 490
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: Proceedings of the Annual Symposium on Computational Geometry
publication_status: published
publisher: ACM
publist_id: '4851'
quality_controlled: '1'
scopus_import: 1
status: public
title: The morse theory of Čech and Delaunay filtrations
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2158'
abstract:
- lang: eng
text: Directional guidance of migrating cells is relatively well explored in the
reductionist setting of cell culture experiments. Here spatial gradients of chemical
cues as well as gradients of mechanical substrate characteristics prove sufficient
to attract single cells as well as their collectives. How such gradients present
and act in the context of an organism is far less clear. Here we review recent
advances in understanding how guidance cues emerge and operate in the physiological
context.
acknowledgement: This effort was supported by the Intramural Research Program of the
Center for Cancer Research, NCI, National Institutes of Health and the European
Research Council (ERC).
author:
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- first_name: Carole
full_name: Parent, Carole
last_name: Parent
citation:
ama: Majumdar R, Sixt MK, Parent C. New paradigms in the establishment and maintenance
of gradients during directed cell migration. Current Opinion in Cell Biology.
2014;30(1):33-40. doi:10.1016/j.ceb.2014.05.010
apa: Majumdar, R., Sixt, M. K., & Parent, C. (2014). New paradigms in the establishment
and maintenance of gradients during directed cell migration. Current Opinion
in Cell Biology. Elsevier. https://doi.org/10.1016/j.ceb.2014.05.010
chicago: Majumdar, Ritankar, Michael K Sixt, and Carole Parent. “New Paradigms in
the Establishment and Maintenance of Gradients during Directed Cell Migration.”
Current Opinion in Cell Biology. Elsevier, 2014. https://doi.org/10.1016/j.ceb.2014.05.010.
ieee: R. Majumdar, M. K. Sixt, and C. Parent, “New paradigms in the establishment
and maintenance of gradients during directed cell migration,” Current Opinion
in Cell Biology, vol. 30, no. 1. Elsevier, pp. 33–40, 2014.
ista: Majumdar R, Sixt MK, Parent C. 2014. New paradigms in the establishment and
maintenance of gradients during directed cell migration. Current Opinion in Cell
Biology. 30(1), 33–40.
mla: Majumdar, Ritankar, et al. “New Paradigms in the Establishment and Maintenance
of Gradients during Directed Cell Migration.” Current Opinion in Cell Biology,
vol. 30, no. 1, Elsevier, 2014, pp. 33–40, doi:10.1016/j.ceb.2014.05.010.
short: R. Majumdar, M.K. Sixt, C. Parent, Current Opinion in Cell Biology 30 (2014)
33–40.
date_created: 2018-12-11T11:56:03Z
date_published: 2014-10-01T00:00:00Z
date_updated: 2021-01-12T06:55:40Z
day: '01'
department:
- _id: MiSi
doi: 10.1016/j.ceb.2014.05.010
external_id:
pmid:
- '24959970'
intvolume: ' 30'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4177954/
month: '10'
oa: 1
oa_version: Submitted Version
page: 33 - 40
pmid: 1
publication: Current Opinion in Cell Biology
publication_status: published
publisher: Elsevier
publist_id: '4848'
quality_controlled: '1'
scopus_import: 1
status: public
title: New paradigms in the establishment and maintenance of gradients during directed
cell migration
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 30
year: '2014'
...
---
_id: '2165'
abstract:
- lang: eng
text: 'In machine learning, the domain adaptation problem arrives when the test
(tar-get) and the train (source) data are generated from different distributions. A
key applied issue is thus the design of algorithms able to generalize on a new
distribution, for which we have no label information. We focus on learning classification
models defined as a weighted majority vote over a set of real-valued functions.
In this context, Germain et al. (2013) have shown that a measure of disagreement
between these functions is crucial to control. The core of this measure is a theoretical
bound—the C-bound (Lacasse et al., 2007)—which involves the disagreement and leads
to a well performing majority vote learn-ing algorithm in usual non-adaptative
supervised setting: MinCq. In this work,we propose a framework to extend MinCq
to a domain adaptation scenario.This procedure takes advantage of the recent perturbed
variation divergence between distributions proposed by Harel and Mannor (2012). Justified
by a theoretical bound on the target risk of the vote, we provide to MinCq a
tar-get sample labeled thanks to a perturbed variation-based self-labeling focused
on the regions where the source and target marginals appear similar. We also
study the influence of our self-labeling, from which we deduce an original process
for tuning the hyperparameters. Finally, our framework called PV-MinCq shows very
promising results on a rotation and translation synthetic problem.'
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. Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based
Self-Labeling. Pattern Recognition Letters. 2014;51:37-43. doi:10.1016/j.patrec.2014.08.013
apa: Morvant, E. (2014). Domain Adaptation of Weighted Majority Votes via Perturbed
Variation-Based Self-Labeling. Pattern Recognition Letters. Elsevier. https://doi.org/10.1016/j.patrec.2014.08.013
chicago: Morvant, Emilie. “Domain Adaptation of Weighted Majority Votes via Perturbed
Variation-Based Self-Labeling.” Pattern Recognition Letters. Elsevier,
2014. https://doi.org/10.1016/j.patrec.2014.08.013.
ieee: E. Morvant, “Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based
Self-Labeling,” Pattern Recognition Letters, vol. 51. Elsevier, pp. 37–43,
2014.
ista: Morvant E. 2014. Domain Adaptation of Weighted Majority Votes via Perturbed
Variation-Based Self-Labeling. Pattern Recognition Letters. 51, 37–43.
mla: Morvant, Emilie. “Domain Adaptation of Weighted Majority Votes via Perturbed
Variation-Based Self-Labeling.” Pattern Recognition Letters, vol. 51, Elsevier,
2014, pp. 37–43, doi:10.1016/j.patrec.2014.08.013.
short: E. Morvant, Pattern Recognition Letters 51 (2014) 37–43.
date_created: 2018-12-11T11:56:05Z
date_published: 2014-10-01T00:00:00Z
date_updated: 2021-01-12T06:55:43Z
day: '01'
doi: 10.1016/j.patrec.2014.08.013
ec_funded: 1
extern: '1'
intvolume: ' 51'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1410.0334
month: '10'
oa: 1
oa_version: Submitted Version
page: 37-43
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication: Pattern Recognition Letters
publication_status: published
publisher: Elsevier
publist_id: '4819'
quality_controlled: '1'
status: public
title: Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based
Self-Labeling
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 51
year: '2014'
...
---
_id: '2164'
abstract:
- lang: eng
text: 'Neuronal ectopia, such as granule cell dispersion (GCD) in temporal lobe
epilepsy (TLE), has been assumed to result from a migration defect during development.
Indeed, recent studies reported that aberrant migration of neonatal-generated
dentate granule cells (GCs) increased the risk to develop epilepsy later in life.
On the contrary, in the present study, we show that fully differentiated GCs become
motile following the induction of epileptiform activity, resulting in GCD. Hippocampal
slice cultures from transgenic mice expressing green fluorescent protein in differentiated,
but not in newly generated GCs, were incubated with the glutamate receptor agonist
kainate (KA), which induced GC burst activity and GCD. Using real-time microscopy,
we observed that KA-exposed, differentiated GCs translocated their cell bodies
and changed their dendritic organization. As found in human TLE, KA application
was associated with decreased expression of the extracellular matrix protein Reelin,
particularly in hilar interneurons. Together these findings suggest that KA-induced
motility of differentiated GCs contributes to the development of GCD and establish
slice cultures as a model to study neuronal changes induced by epileptiform activity. '
author:
- first_name: Xuejun
full_name: Chai, Xuejun
last_name: Chai
- first_name: Gert
full_name: Münzner, Gert
last_name: Münzner
- first_name: Shanting
full_name: Zhao, Shanting
last_name: Zhao
- first_name: Stefanie
full_name: Tinnes, Stefanie
last_name: Tinnes
- first_name: Janina
full_name: Kowalski, Janina
id: 3F3CA136-F248-11E8-B48F-1D18A9856A87
last_name: Kowalski
- first_name: Ute
full_name: Häussler, Ute
last_name: Häussler
- first_name: Christina
full_name: Young, Christina
last_name: Young
- first_name: Carola
full_name: Haas, Carola
last_name: Haas
- first_name: Michael
full_name: Frotscher, Michael
last_name: Frotscher
citation:
ama: Chai X, Münzner G, Zhao S, et al. Epilepsy-induced motility of differentiated
neurons. Cerebral Cortex. 2014;24(8):2130-2140. doi:10.1093/cercor/bht067
apa: Chai, X., Münzner, G., Zhao, S., Tinnes, S., Kowalski, J., Häussler, U., …
Frotscher, M. (2014). Epilepsy-induced motility of differentiated neurons. Cerebral
Cortex. Oxford University Press. https://doi.org/10.1093/cercor/bht067
chicago: Chai, Xuejun, Gert Münzner, Shanting Zhao, Stefanie Tinnes, Janina Kowalski,
Ute Häussler, Christina Young, Carola Haas, and Michael Frotscher. “Epilepsy-Induced
Motility of Differentiated Neurons.” Cerebral Cortex. Oxford University
Press, 2014. https://doi.org/10.1093/cercor/bht067.
ieee: X. Chai et al., “Epilepsy-induced motility of differentiated neurons,”
Cerebral Cortex, vol. 24, no. 8. Oxford University Press, pp. 2130–2140,
2014.
ista: Chai X, Münzner G, Zhao S, Tinnes S, Kowalski J, Häussler U, Young C, Haas
C, Frotscher M. 2014. Epilepsy-induced motility of differentiated neurons. Cerebral
Cortex. 24(8), 2130–2140.
mla: Chai, Xuejun, et al. “Epilepsy-Induced Motility of Differentiated Neurons.”
Cerebral Cortex, vol. 24, no. 8, Oxford University Press, 2014, pp. 2130–40,
doi:10.1093/cercor/bht067.
short: X. Chai, G. Münzner, S. Zhao, S. Tinnes, J. Kowalski, U. Häussler, C. Young,
C. Haas, M. Frotscher, Cerebral Cortex 24 (2014) 2130–2140.
date_created: 2018-12-11T11:56:04Z
date_published: 2014-08-01T00:00:00Z
date_updated: 2021-01-12T06:55:43Z
day: '01'
department:
- _id: PeJo
doi: 10.1093/cercor/bht067
intvolume: ' 24'
issue: '8'
language:
- iso: eng
month: '08'
oa_version: None
page: 2130 - 2140
publication: Cerebral Cortex
publication_status: published
publisher: Oxford University Press
publist_id: '4820'
quality_controlled: '1'
scopus_import: 1
status: public
title: Epilepsy-induced motility of differentiated neurons
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 24
year: '2014'
...
---
_id: '2168'
abstract:
- lang: eng
text: Many species have an essentially continuous distribution in space, in which
there are no natural divisions between randomly mating subpopulations. Yet, the
standard approach to modelling these populations is to impose an arbitrary grid
of demes, adjusting deme sizes and migration rates in an attempt to capture the
important features of the population. Such indirect methods are required because
of the failure of the classical models of isolation by distance, which have been
shown to have major technical flaws. A recently introduced model of extinction
and recolonisation in two dimensions solves these technical problems, and provides
a rigorous technical foundation for the study of populations evolving in a spatial
continuum. The coalescent process for this model is simply stated, but direct
simulation is very inefficient for large neighbourhood sizes. We present efficient
and exact algorithms to simulate this coalescent process for arbitrary sample
sizes and numbers of loci, and analyse these algorithms in detail.
author:
- first_name: Jerome
full_name: Kelleher, Jerome
last_name: Kelleher
- first_name: Alison
full_name: Etheridge, Alison
last_name: Etheridge
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: 'Kelleher J, Etheridge A, Barton NH. Coalescent simulation in continuous space:
Algorithms for large neighbourhood size. Theoretical Population Biology.
2014;95:13-23. doi:10.1016/j.tpb.2014.05.001'
apa: 'Kelleher, J., Etheridge, A., & Barton, N. H. (2014). Coalescent simulation
in continuous space: Algorithms for large neighbourhood size. Theoretical Population
Biology. Academic Press. https://doi.org/10.1016/j.tpb.2014.05.001'
chicago: 'Kelleher, Jerome, Alison Etheridge, and Nicholas H Barton. “Coalescent
Simulation in Continuous Space: Algorithms for Large Neighbourhood Size.” Theoretical
Population Biology. Academic Press, 2014. https://doi.org/10.1016/j.tpb.2014.05.001.'
ieee: 'J. Kelleher, A. Etheridge, and N. H. Barton, “Coalescent simulation in continuous
space: Algorithms for large neighbourhood size,” Theoretical Population Biology,
vol. 95. Academic Press, pp. 13–23, 2014.'
ista: 'Kelleher J, Etheridge A, Barton NH. 2014. Coalescent simulation in continuous
space: Algorithms for large neighbourhood size. Theoretical Population Biology.
95, 13–23.'
mla: 'Kelleher, Jerome, et al. “Coalescent Simulation in Continuous Space: Algorithms
for Large Neighbourhood Size.” Theoretical Population Biology, vol. 95,
Academic Press, 2014, pp. 13–23, doi:10.1016/j.tpb.2014.05.001.'
short: J. Kelleher, A. Etheridge, N.H. Barton, Theoretical Population Biology 95
(2014) 13–23.
date_created: 2018-12-11T11:56:06Z
date_published: 2014-08-01T00:00:00Z
date_updated: 2021-01-12T06:55:44Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1016/j.tpb.2014.05.001
ec_funded: 1
file:
- access_level: open_access
checksum: 979d7a8034e9df198f068f0d251f31bd
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:49Z
date_updated: 2020-07-14T12:45:31Z
file_id: '4839'
file_name: IST-2015-391-v1+1_1-s2.0-S0040580914000355-main.pdf
file_size: 569005
relation: main_file
file_date_updated: 2020-07-14T12:45:31Z
has_accepted_license: '1'
intvolume: ' 95'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 13 - 23
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: Theoretical Population Biology
publication_status: published
publisher: Academic Press
publist_id: '4816'
pubrep_id: '391'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Coalescent simulation in continuous space: Algorithms for large neighbourhood
size'
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: 95
year: '2014'
...
---
_id: '2169'
author:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Sebastian
full_name: Novak, Sebastian
id: 461468AE-F248-11E8-B48F-1D18A9856A87
last_name: Novak
- first_name: Tiago
full_name: Paixao, Tiago
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
citation:
ama: Barton NH, Novak S, Paixao T. Diverse forms of selection in evolution and computer
science. PNAS. 2014;111(29):10398-10399. doi:10.1073/pnas.1410107111
apa: Barton, N. H., Novak, S., & Paixao, T. (2014). Diverse forms of selection
in evolution and computer science. PNAS. National Academy of Sciences.
https://doi.org/10.1073/pnas.1410107111
chicago: Barton, Nicholas H, Sebastian Novak, and Tiago Paixao. “Diverse Forms of
Selection in Evolution and Computer Science.” PNAS. National Academy of
Sciences, 2014. https://doi.org/10.1073/pnas.1410107111.
ieee: N. H. Barton, S. Novak, and T. Paixao, “Diverse forms of selection in evolution
and computer science,” PNAS, vol. 111, no. 29. National Academy of Sciences,
pp. 10398–10399, 2014.
ista: Barton NH, Novak S, Paixao T. 2014. Diverse forms of selection in evolution
and computer science. PNAS. 111(29), 10398–10399.
mla: Barton, Nicholas H., et al. “Diverse Forms of Selection in Evolution and Computer
Science.” PNAS, vol. 111, no. 29, National Academy of Sciences, 2014, pp.
10398–99, doi:10.1073/pnas.1410107111.
short: N.H. Barton, S. Novak, T. Paixao, PNAS 111 (2014) 10398–10399.
date_created: 2018-12-11T11:56:07Z
date_published: 2014-07-22T00:00:00Z
date_updated: 2021-01-12T06:55:45Z
day: '22'
department:
- _id: NiBa
doi: 10.1073/pnas.1410107111
intvolume: ' 111'
issue: '29'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4115508/
month: '07'
oa: 1
oa_version: Submitted Version
page: 10398 - 10399
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '4815'
quality_controlled: '1'
scopus_import: 1
status: public
title: Diverse forms of selection in evolution and computer science
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 111
year: '2014'
...
---
_id: '2171'
abstract:
- lang: eng
text: We present LS-CRF, a new method for training cyclic Conditional Random Fields
(CRFs) from large datasets that is inspired by classical closed-form expressions
for the maximum likelihood parameters of a generative graphical model with tree
topology. Training a CRF with LS-CRF requires only solving a set of independent
regression problems, each of which can be solved efficiently in closed form or
by an iterative solver. This makes LS-CRF orders of magnitude faster than classical
CRF training based on probabilistic inference, and at the same time more flexible
and easier to implement than other approximate techniques, such as pseudolikelihood
or piecewise training. We apply LS-CRF to the task of semantic image segmentation,
showing that it achieves on par accuracy to other training techniques at higher
speed, thereby allowing efficient CRF training from very large training sets.
For example, training a linearly parameterized pairwise CRF on 150,000 images
requires less than one hour on a modern workstation.
alternative_title:
- LNCS
author:
- first_name: Alexander
full_name: Kolesnikov, Alexander
id: 2D157DB6-F248-11E8-B48F-1D18A9856A87
last_name: Kolesnikov
- first_name: Matthieu
full_name: Guillaumin, Matthieu
last_name: Guillaumin
- first_name: Vittorio
full_name: Ferrari, Vittorio
last_name: Ferrari
- 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, Guillaumin M, Ferrari V, Lampert C. Closed-form approximate
CRF training for scalable image segmentation. In: Fleet D, Pajdla T, Schiele B,
Tuytelaars T, eds. Lecture Notes in Computer Science (Including Subseries Lecture
Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol
8691. Springer; 2014:550-565. doi:10.1007/978-3-319-10578-9_36'
apa: 'Kolesnikov, A., Guillaumin, M., Ferrari, V., & Lampert, C. (2014). Closed-form
approximate CRF training for scalable image segmentation. In D. Fleet, T. Pajdla,
B. Schiele, & T. Tuytelaars (Eds.), Lecture Notes in Computer Science (including
subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
(Vol. 8691, pp. 550–565). Zurich, Switzerland: Springer. https://doi.org/10.1007/978-3-319-10578-9_36'
chicago: Kolesnikov, Alexander, Matthieu Guillaumin, Vittorio Ferrari, and Christoph
Lampert. “Closed-Form Approximate CRF Training for Scalable Image Segmentation.”
In Lecture Notes in Computer Science (Including Subseries Lecture Notes in
Artificial Intelligence and Lecture Notes in Bioinformatics), edited by David
Fleet, Tomas Pajdla, Bernt Schiele, and Tinne Tuytelaars, 8691:550–65. Springer,
2014. https://doi.org/10.1007/978-3-319-10578-9_36.
ieee: A. Kolesnikov, M. Guillaumin, V. Ferrari, and C. Lampert, “Closed-form approximate
CRF training for scalable image segmentation,” in Lecture Notes in Computer
Science (including subseries Lecture Notes in Artificial Intelligence and Lecture
Notes in Bioinformatics), Zurich, Switzerland, 2014, vol. 8691, no. PART 3,
pp. 550–565.
ista: 'Kolesnikov A, Guillaumin M, Ferrari V, Lampert C. 2014. Closed-form approximate
CRF training for scalable image segmentation. Lecture Notes in Computer Science
(including subseries Lecture Notes in Artificial Intelligence and Lecture Notes
in Bioinformatics). ECCV: European Conference on Computer Vision, LNCS, vol. 8691,
550–565.'
mla: Kolesnikov, Alexander, et al. “Closed-Form Approximate CRF Training for Scalable
Image Segmentation.” Lecture Notes in Computer Science (Including Subseries
Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
edited by David Fleet et al., vol. 8691, no. PART 3, Springer, 2014, pp. 550–65,
doi:10.1007/978-3-319-10578-9_36.
short: A. Kolesnikov, M. Guillaumin, V. Ferrari, C. Lampert, in:, D. Fleet, T. Pajdla,
B. Schiele, T. Tuytelaars (Eds.), Lecture Notes in Computer Science (Including
Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
Springer, 2014, pp. 550–565.
conference:
end_date: 2014-09-12
location: Zurich, Switzerland
name: 'ECCV: European Conference on Computer Vision'
start_date: 2014-09-06
date_created: 2018-12-11T11:56:07Z
date_published: 2014-09-01T00:00:00Z
date_updated: 2021-01-12T06:55:46Z
day: '01'
department:
- _id: ChLa
doi: 10.1007/978-3-319-10578-9_36
ec_funded: 1
editor:
- first_name: David
full_name: Fleet, David
last_name: Fleet
- first_name: Tomas
full_name: Pajdla, Tomas
last_name: Pajdla
- first_name: Bernt
full_name: Schiele, Bernt
last_name: Schiele
- first_name: Tinne
full_name: Tuytelaars, Tinne
last_name: Tuytelaars
intvolume: ' 8691'
issue: PART 3
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1403.7057
month: '09'
oa: 1
oa_version: Submitted Version
page: 550 - 565
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication: Lecture Notes in Computer Science (including subseries Lecture Notes
in Artificial Intelligence and Lecture Notes in Bioinformatics)
publication_status: published
publisher: Springer
publist_id: '4813'
quality_controlled: '1'
scopus_import: 1
status: public
title: Closed-form approximate CRF training for scalable image segmentation
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 8691
year: '2014'
...
---
_id: '2173'
abstract:
- lang: eng
text: "In this work we introduce a new approach to co-classification, i.e. the task
of jointly classifying multiple, otherwise independent, data samples. The method
we present, named CoConut, is based on the idea of adding a regularizer in the
label space to encode certain priors on the resulting labelings. A regularizer
that encourages labelings that are smooth across the test set, for instance, can
be seen as a test-time variant of the cluster assumption, which has been proven
useful at training time in semi-supervised learning. A regularizer that introduces
a preference for certain class proportions can be regarded as a prior distribution
on the class labels. CoConut can build on existing classifiers without making
any assumptions on how they were obtained and without the need to re-train them.
The use of a regularizer adds a new level of flexibility. It allows the integration
of potentially new information at test time, even in other modalities than what
the classifiers were trained on. We evaluate our framework on six datasets, reporting
a clear performance gain in classification accuracy compared to the standard classification
setup that predicts labels for each test sample separately.\r\n"
author:
- first_name: Sameh
full_name: Khamis, Sameh
last_name: Khamis
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Khamis S, Lampert C. CoConut: Co-classification with output space regularization.
In: Proceedings of the British Machine Vision Conference 2014. BMVA Press;
2014.'
apa: 'Khamis, S., & Lampert, C. (2014). CoConut: Co-classification with output
space regularization. In Proceedings of the British Machine Vision Conference
2014. Nottingham, UK: BMVA Press.'
chicago: 'Khamis, Sameh, and Christoph Lampert. “CoConut: Co-Classification with
Output Space Regularization.” In Proceedings of the British Machine Vision
Conference 2014. BMVA Press, 2014.'
ieee: 'S. Khamis and C. Lampert, “CoConut: Co-classification with output space regularization,”
in Proceedings of the British Machine Vision Conference 2014, Nottingham,
UK, 2014.'
ista: 'Khamis S, Lampert C. 2014. CoConut: Co-classification with output space regularization.
Proceedings of the British Machine Vision Conference 2014. BMVC: British Machine
Vision Conference.'
mla: 'Khamis, Sameh, and Christoph Lampert. “CoConut: Co-Classification with Output
Space Regularization.” Proceedings of the British Machine Vision Conference
2014, BMVA Press, 2014.'
short: S. Khamis, C. Lampert, in:, Proceedings of the British Machine Vision Conference
2014, BMVA Press, 2014.
conference:
end_date: 2014-09-05
location: Nottingham, UK
name: 'BMVC: British Machine Vision Conference'
start_date: 2014-09-01
date_created: 2018-12-11T11:56:08Z
date_published: 2014-09-01T00:00:00Z
date_updated: 2021-01-12T06:55:46Z
day: '01'
ddc:
- '000'
department:
- _id: ChLa
ec_funded: 1
file:
- access_level: open_access
checksum: c4c6d3efdb8ee648faf3e76849839ce2
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:23Z
date_updated: 2020-07-14T12:45:31Z
file_id: '4683'
file_name: IST-2016-490-v1+1_khamis-bmvc2014.pdf
file_size: 408172
relation: main_file
file_date_updated: 2020-07-14T12:45:31Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
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 2014
publication_status: published
publisher: BMVA Press
publist_id: '4811'
pubrep_id: '490'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'CoConut: Co-classification with output space regularization'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2172'
abstract:
- lang: eng
text: Fisher Kernels and Deep Learning were two developments with significant impact
on large-scale object categorization in the last years. Both approaches were shown
to achieve state-of-the-art results on large-scale object categorization datasets,
such as ImageNet. Conceptually, however, they are perceived as very different
and it is not uncommon for heated debates to spring up when advocates of both
paradigms meet at conferences or workshops. In this work, we emphasize the similarities
between both architectures rather than their differences and we argue that such
a unified view allows us to transfer ideas from one domain to the other. As a
concrete example we introduce a method for learning a support vector machine classifier
with Fisher kernel at the same time as a task-specific data representation. We
reinterpret the setting as a multi-layer feed forward network. Its final layer
is the classifier, parameterized by a weight vector, and the two previous layers
compute Fisher vectors, parameterized by the coefficients of a Gaussian mixture
model. We introduce a gradient descent based learning algorithm that, in contrast
to other feature learning techniques, is not just derived from intuition or biological
analogy, but has a theoretical justification in the framework of statistical learning
theory. Our experiments show that the new training procedure leads to significant
improvements in classification accuracy while preserving the modularity and geometric
interpretability of a support vector machine setup.
author:
- first_name: Vladyslav
full_name: Sydorov, Vladyslav
last_name: Sydorov
- first_name: Mayu
full_name: Sakurada, Mayu
last_name: Sakurada
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Sydorov V, Sakurada M, Lampert C. Deep Fisher Kernels – End to end learning
of the Fisher Kernel GMM parameters. In: Proceedings of the IEEE Computer Society
Conference on Computer Vision and Pattern Recognition. IEEE; 2014:1402-1409.
doi:10.1109/CVPR.2014.182'
apa: 'Sydorov, V., Sakurada, M., & Lampert, C. (2014). Deep Fisher Kernels –
End to end learning of the Fisher Kernel GMM parameters. In Proceedings of
the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
(pp. 1402–1409). Columbus, USA: IEEE. https://doi.org/10.1109/CVPR.2014.182'
chicago: Sydorov, Vladyslav, Mayu Sakurada, and Christoph Lampert. “Deep Fisher
Kernels – End to End Learning of the Fisher Kernel GMM Parameters.” In Proceedings
of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition,
1402–9. IEEE, 2014. https://doi.org/10.1109/CVPR.2014.182.
ieee: V. Sydorov, M. Sakurada, and C. Lampert, “Deep Fisher Kernels – End to end
learning of the Fisher Kernel GMM parameters,” in Proceedings of the IEEE Computer
Society Conference on Computer Vision and Pattern Recognition, Columbus, USA,
2014, pp. 1402–1409.
ista: 'Sydorov V, Sakurada M, Lampert C. 2014. Deep Fisher Kernels – End to end
learning of the Fisher Kernel GMM parameters. Proceedings of the IEEE Computer
Society Conference on Computer Vision and Pattern Recognition. CVPR: Computer
Vision and Pattern Recognition, 1402–1409.'
mla: Sydorov, Vladyslav, et al. “Deep Fisher Kernels – End to End Learning of the
Fisher Kernel GMM Parameters.” Proceedings of the IEEE Computer Society Conference
on Computer Vision and Pattern Recognition, IEEE, 2014, pp. 1402–09, doi:10.1109/CVPR.2014.182.
short: V. Sydorov, M. Sakurada, C. Lampert, in:, Proceedings of the IEEE Computer
Society Conference on Computer Vision and Pattern Recognition, IEEE, 2014, pp.
1402–1409.
conference:
end_date: 2014-06-28
location: Columbus, USA
name: 'CVPR: Computer Vision and Pattern Recognition'
start_date: 2014-06-23
date_created: 2018-12-11T11:56:08Z
date_published: 2014-09-24T00:00:00Z
date_updated: 2021-01-12T06:55:46Z
day: '24'
department:
- _id: ChLa
doi: 10.1109/CVPR.2014.182
ec_funded: 1
language:
- iso: eng
month: '09'
oa_version: None
page: 1402 - 1409
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication: Proceedings of the IEEE Computer Society Conference on Computer Vision
and Pattern Recognition
publication_status: published
publisher: IEEE
publist_id: '4812'
quality_controlled: '1'
scopus_import: 1
status: public
title: Deep Fisher Kernels – End to end learning of the Fisher Kernel GMM parameters
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2174'
abstract:
- lang: eng
text: 'When polygenic traits are under stabilizing selection, many different combinations
of alleles allow close adaptation to the optimum. If alleles have equal effects,
all combinations that result in the same deviation from the optimum are equivalent.
Furthermore, the genetic variance that is maintained by mutation-selection balance
is 2μ/S per locus, where μ is the mutation rate and S the strength of stabilizing
selection. In reality, alleles vary in their effects, making the fitness landscape
asymmetric and complicating analysis of the equilibria. We show that that the
resulting genetic variance depends on the fraction of alleles near fixation, which
contribute by 2μ/S, and on the total mutational effects of alleles that are at
intermediate frequency. The inpplayfi between stabilizing selection and mutation
leads to a sharp transition: alleles with effects smaller than a threshold value
of 2 remain polymorphic, whereas those with larger effects are fixed. The genetic
load in equilibrium is less than for traits of equal effects, and the fitness
equilibria are more similar. We find p the optimum is displaced, alleles with
effects close to the threshold value sweep first, and their rate of increase is
bounded by Long-term response leads in general to well-adapted traits, unlike
the case of equal effects that often end up at a suboptimal fitness peak. However,
the particular peaks to which the populations converge are extremely sensitive
to the initial states and to the speed of the shift of the optimum trait value.'
author:
- first_name: Harold
full_name: De Vladar, Harold
last_name: De Vladar
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: De Vladar H, Barton NH. Stability and response of polygenic traits to stabilizing
selection and mutation. Genetics. 2014;197(2):749-767. doi:10.1534/genetics.113.159111
apa: De Vladar, H., & Barton, N. H. (2014). Stability and response of polygenic
traits to stabilizing selection and mutation. Genetics. Genetics Society
of America. https://doi.org/10.1534/genetics.113.159111
chicago: De Vladar, Harold, and Nicholas H Barton. “Stability and Response of Polygenic
Traits to Stabilizing Selection and Mutation.” Genetics. Genetics Society
of America, 2014. https://doi.org/10.1534/genetics.113.159111.
ieee: H. De Vladar and N. H. Barton, “Stability and response of polygenic traits
to stabilizing selection and mutation,” Genetics, vol. 197, no. 2. Genetics
Society of America, pp. 749–767, 2014.
ista: De Vladar H, Barton NH. 2014. Stability and response of polygenic traits to
stabilizing selection and mutation. Genetics. 197(2), 749–767.
mla: De Vladar, Harold, and Nicholas H. Barton. “Stability and Response of Polygenic
Traits to Stabilizing Selection and Mutation.” Genetics, vol. 197, no.
2, Genetics Society of America, 2014, pp. 749–67, doi:10.1534/genetics.113.159111.
short: H. De Vladar, N.H. Barton, Genetics 197 (2014) 749–767.
date_created: 2018-12-11T11:56:08Z
date_published: 2014-06-01T00:00:00Z
date_updated: 2021-01-12T06:55:47Z
day: '01'
department:
- _id: NiBa
doi: 10.1534/genetics.113.159111
ec_funded: 1
intvolume: ' 197'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1404.1017
month: '06'
oa: 1
oa_version: Submitted Version
page: 749 - 767
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: Genetics
publication_status: published
publisher: Genetics Society of America
publist_id: '4809'
quality_controlled: '1'
scopus_import: 1
status: public
title: Stability and response of polygenic traits to stabilizing selection and mutation
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 197
year: '2014'
...
---
_id: '2179'
abstract:
- lang: eng
text: We extend the proof of the local semicircle law for generalized Wigner matrices
given in MR3068390 to the case when the matrix of variances has an eigenvalue
-1. In particular, this result provides a short proof of the optimal local Marchenko-Pastur
law at the hard edge (i.e. around zero) for sample covariance matrices X*X, where
the variances of the entries of X may vary.
author:
- first_name: Oskari H
full_name: Ajanki, Oskari H
id: 36F2FB7E-F248-11E8-B48F-1D18A9856A87
last_name: Ajanki
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Torben H
full_name: Krüger, Torben H
id: 3020C786-F248-11E8-B48F-1D18A9856A87
last_name: Krüger
orcid: 0000-0002-4821-3297
citation:
ama: Ajanki OH, Erdös L, Krüger TH. Local semicircle law with imprimitive variance
matrix. Electronic Communications in Probability. 2014;19. doi:10.1214/ECP.v19-3121
apa: Ajanki, O. H., Erdös, L., & Krüger, T. H. (2014). Local semicircle law
with imprimitive variance matrix. Electronic Communications in Probability.
Institute of Mathematical Statistics. https://doi.org/10.1214/ECP.v19-3121
chicago: Ajanki, Oskari H, László Erdös, and Torben H Krüger. “Local Semicircle
Law with Imprimitive Variance Matrix.” Electronic Communications in Probability.
Institute of Mathematical Statistics, 2014. https://doi.org/10.1214/ECP.v19-3121.
ieee: O. H. Ajanki, L. Erdös, and T. H. Krüger, “Local semicircle law with imprimitive
variance matrix,” Electronic Communications in Probability, vol. 19. Institute
of Mathematical Statistics, 2014.
ista: Ajanki OH, Erdös L, Krüger TH. 2014. Local semicircle law with imprimitive
variance matrix. Electronic Communications in Probability. 19.
mla: Ajanki, Oskari H., et al. “Local Semicircle Law with Imprimitive Variance Matrix.”
Electronic Communications in Probability, vol. 19, Institute of Mathematical
Statistics, 2014, doi:10.1214/ECP.v19-3121.
short: O.H. Ajanki, L. Erdös, T.H. Krüger, Electronic Communications in Probability
19 (2014).
date_created: 2018-12-11T11:56:10Z
date_published: 2014-06-09T00:00:00Z
date_updated: 2021-01-12T06:55:48Z
day: '09'
ddc:
- '570'
department:
- _id: LaEr
doi: 10.1214/ECP.v19-3121
file:
- access_level: open_access
checksum: bd8a041c76d62fe820bf73ff13ce7d1b
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:06Z
date_updated: 2020-07-14T12:45:31Z
file_id: '4729'
file_name: IST-2016-426-v1+1_3121-17518-1-PB.pdf
file_size: 327322
relation: main_file
file_date_updated: 2020-07-14T12:45:31Z
has_accepted_license: '1'
intvolume: ' 19'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: Electronic Communications in Probability
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '4803'
pubrep_id: '426'
quality_controlled: '1'
scopus_import: 1
status: public
title: Local semicircle law with imprimitive variance matrix
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: 19
year: '2014'
...
---
_id: '2176'
abstract:
- lang: eng
text: Electron microscopy (EM) allows for the simultaneous visualization of all
tissue components at high resolution. However, the extent to which conventional
aldehyde fixation and ethanol dehydration of the tissue alter the fine structure
of cells and organelles, thereby preventing detection of subtle structural changes
induced by an experiment, has remained an issue. Attempts have been made to rapidly
freeze tissue to preserve native ultrastructure. Shock-freezing of living tissue
under high pressure (high-pressure freezing, HPF) followed by cryosubstitution
of the tissue water avoids aldehyde fixation and dehydration in ethanol; the tissue
water is immobilized in â ̂1/450 ms, and a close-to-native fine structure of cells,
organelles and molecules is preserved. Here we describe a protocol for HPF that
is useful to monitor ultrastructural changes associated with functional changes
at synapses in the brain but can be applied to many other tissues as well. The
procedure requires a high-pressure freezer and takes a minimum of 7 d but can
be paused at several points.
author:
- first_name: Daniel
full_name: Studer, Daniel
last_name: Studer
- first_name: Shanting
full_name: Zhao, Shanting
last_name: Zhao
- first_name: Xuejun
full_name: Chai, Xuejun
last_name: Chai
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
- first_name: Werner
full_name: Graber, Werner
last_name: Graber
- first_name: Sigrun
full_name: Nestel, Sigrun
last_name: Nestel
- first_name: Michael
full_name: Frotscher, Michael
last_name: Frotscher
citation:
ama: Studer D, Zhao S, Chai X, et al. Capture of activity-induced ultrastructural
changes at synapses by high-pressure freezing of brain tissue. Nature Protocols.
2014;9(6):1480-1495. doi:10.1038/nprot.2014.099
apa: Studer, D., Zhao, S., Chai, X., Jonas, P. M., Graber, W., Nestel, S., &
Frotscher, M. (2014). Capture of activity-induced ultrastructural changes at synapses
by high-pressure freezing of brain tissue. Nature Protocols. Nature Publishing
Group. https://doi.org/10.1038/nprot.2014.099
chicago: Studer, Daniel, Shanting Zhao, Xuejun Chai, Peter M Jonas, Werner Graber,
Sigrun Nestel, and Michael Frotscher. “Capture of Activity-Induced Ultrastructural
Changes at Synapses by High-Pressure Freezing of Brain Tissue.” Nature Protocols.
Nature Publishing Group, 2014. https://doi.org/10.1038/nprot.2014.099.
ieee: D. Studer et al., “Capture of activity-induced ultrastructural changes
at synapses by high-pressure freezing of brain tissue,” Nature Protocols,
vol. 9, no. 6. Nature Publishing Group, pp. 1480–1495, 2014.
ista: Studer D, Zhao S, Chai X, Jonas PM, Graber W, Nestel S, Frotscher M. 2014.
Capture of activity-induced ultrastructural changes at synapses by high-pressure
freezing of brain tissue. Nature Protocols. 9(6), 1480–1495.
mla: Studer, Daniel, et al. “Capture of Activity-Induced Ultrastructural Changes
at Synapses by High-Pressure Freezing of Brain Tissue.” Nature Protocols,
vol. 9, no. 6, Nature Publishing Group, 2014, pp. 1480–95, doi:10.1038/nprot.2014.099.
short: D. Studer, S. Zhao, X. Chai, P.M. Jonas, W. Graber, S. Nestel, M. Frotscher,
Nature Protocols 9 (2014) 1480–1495.
date_created: 2018-12-11T11:56:09Z
date_published: 2014-05-29T00:00:00Z
date_updated: 2021-01-12T06:55:47Z
day: '29'
department:
- _id: PeJo
doi: 10.1038/nprot.2014.099
intvolume: ' 9'
issue: '6'
language:
- iso: eng
month: '05'
oa_version: None
page: 1480 - 1495
project:
- _id: 25BDE9A4-B435-11E9-9278-68D0E5697425
grant_number: SFB-TR3-TP10B
name: Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen
publication: Nature Protocols
publication_status: published
publisher: Nature Publishing Group
publist_id: '4807'
quality_controlled: '1'
scopus_import: 1
status: public
title: Capture of activity-induced ultrastructural changes at synapses by high-pressure
freezing of brain tissue
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2014'
...
---
_id: '2178'
abstract:
- lang: eng
text: We consider the three-state toric homogeneous Markov chain model (THMC) without
loops and initial parameters. At time T, the size of the design matrix is 6 ×
3 · 2T-1 and the convex hull of its columns is the model polytope. We study the
behavior of this polytope for T ≥ 3 and we show that it is defined by 24 facets
for all T ≥ 5. Moreover, we give a complete description of these facets. From
this, we deduce that the toric ideal associated with the design matrix is generated
by binomials of degree at most 6. Our proof is based on a result due to Sturmfels,
who gave a bound on the degree of the generators of a toric ideal, provided the
normality of the corresponding toric variety. In our setting, we established the
normality of the toric variety associated to the THMC model by studying the geometric
properties of the model polytope.
acknowledgement: Research of Martín del Campo supported in part by NSF Grant DMS-915211.
author:
- first_name: David
full_name: Haws, David
last_name: Haws
- first_name: Abraham
full_name: Martin Del Campo Sanchez, Abraham
id: 4CF47F6A-F248-11E8-B48F-1D18A9856A87
last_name: Martin Del Campo Sanchez
- first_name: Akimichi
full_name: Takemura, Akimichi
last_name: Takemura
- first_name: Ruriko
full_name: Yoshida, Ruriko
last_name: Yoshida
citation:
ama: Haws D, Martin del Campo Sanchez A, Takemura A, Yoshida R. Markov degree of
the three-state toric homogeneous Markov chain model. Beitrage zur Algebra
und Geometrie. 2014;55(1):161-188. doi:10.1007/s13366-013-0178-y
apa: Haws, D., Martin del Campo Sanchez, A., Takemura, A., & Yoshida, R. (2014).
Markov degree of the three-state toric homogeneous Markov chain model. Beitrage
Zur Algebra Und Geometrie. Springer. https://doi.org/10.1007/s13366-013-0178-y
chicago: Haws, David, Abraham Martin del Campo Sanchez, Akimichi Takemura, and Ruriko
Yoshida. “Markov Degree of the Three-State Toric Homogeneous Markov Chain Model.”
Beitrage Zur Algebra Und Geometrie. Springer, 2014. https://doi.org/10.1007/s13366-013-0178-y.
ieee: D. Haws, A. Martin del Campo Sanchez, A. Takemura, and R. Yoshida, “Markov
degree of the three-state toric homogeneous Markov chain model,” Beitrage zur
Algebra und Geometrie, vol. 55, no. 1. Springer, pp. 161–188, 2014.
ista: Haws D, Martin del Campo Sanchez A, Takemura A, Yoshida R. 2014. Markov degree
of the three-state toric homogeneous Markov chain model. Beitrage zur Algebra
und Geometrie. 55(1), 161–188.
mla: Haws, David, et al. “Markov Degree of the Three-State Toric Homogeneous Markov
Chain Model.” Beitrage Zur Algebra Und Geometrie, vol. 55, no. 1, Springer,
2014, pp. 161–88, doi:10.1007/s13366-013-0178-y.
short: D. Haws, A. Martin del Campo Sanchez, A. Takemura, R. Yoshida, Beitrage Zur
Algebra Und Geometrie 55 (2014) 161–188.
date_created: 2018-12-11T11:56:10Z
date_published: 2014-03-01T00:00:00Z
date_updated: 2021-01-12T06:55:48Z
day: '01'
department:
- _id: CaUh
doi: 10.1007/s13366-013-0178-y
intvolume: ' 55'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1204.3070
month: '03'
oa: 1
oa_version: Submitted Version
page: 161 - 188
publication: Beitrage zur Algebra und Geometrie
publication_status: published
publisher: Springer
publist_id: '4804'
quality_controlled: '1'
scopus_import: 1
status: public
title: Markov degree of the three-state toric homogeneous Markov chain model
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 55
year: '2014'
...
---
_id: '2177'
abstract:
- lang: eng
text: We give evidence for the difficulty of computing Betti numbers of simplicial
complexes over a finite field. We do this by reducing the rank computation for
sparse matrices with to non-zero entries to computing Betti numbers of simplicial
complexes consisting of at most a constant times to simplices. Together with the
known reduction in the other direction, this implies that the two problems have
the same computational complexity.
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Salman
full_name: Parsa, Salman
id: 4BDBD4F2-F248-11E8-B48F-1D18A9856A87
last_name: Parsa
citation:
ama: 'Edelsbrunner H, Parsa S. On the computational complexity of betti numbers
reductions from matrix rank. In: Proceedings of the Annual ACM-SIAM Symposium
on Discrete Algorithms. SIAM; 2014:152-160. doi:10.1137/1.9781611973402.11'
apa: 'Edelsbrunner, H., & Parsa, S. (2014). On the computational complexity
of betti numbers reductions from matrix rank. In Proceedings of the Annual
ACM-SIAM Symposium on Discrete Algorithms (pp. 152–160). Portland, USA: SIAM.
https://doi.org/10.1137/1.9781611973402.11'
chicago: Edelsbrunner, Herbert, and Salman Parsa. “On the Computational Complexity
of Betti Numbers Reductions from Matrix Rank.” In Proceedings of the Annual
ACM-SIAM Symposium on Discrete Algorithms, 152–60. SIAM, 2014. https://doi.org/10.1137/1.9781611973402.11.
ieee: H. Edelsbrunner and S. Parsa, “On the computational complexity of betti numbers
reductions from matrix rank,” in Proceedings of the Annual ACM-SIAM Symposium
on Discrete Algorithms, Portland, USA, 2014, pp. 152–160.
ista: 'Edelsbrunner H, Parsa S. 2014. On the computational complexity of betti numbers
reductions from matrix rank. Proceedings of the Annual ACM-SIAM Symposium on Discrete
Algorithms. SODA: Symposium on Discrete Algorithms, 152–160.'
mla: Edelsbrunner, Herbert, and Salman Parsa. “On the Computational Complexity of
Betti Numbers Reductions from Matrix Rank.” Proceedings of the Annual ACM-SIAM
Symposium on Discrete Algorithms, SIAM, 2014, pp. 152–60, doi:10.1137/1.9781611973402.11.
short: H. Edelsbrunner, S. Parsa, in:, Proceedings of the Annual ACM-SIAM Symposium
on Discrete Algorithms, SIAM, 2014, pp. 152–160.
conference:
end_date: 2014-01-07
location: Portland, USA
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2014-01-05
date_created: 2018-12-11T11:56:09Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:55:48Z
day: '01'
department:
- _id: HeEd
doi: 10.1137/1.9781611973402.11
language:
- iso: eng
month: '01'
oa_version: None
page: 152 - 160
publication: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
publication_status: published
publisher: SIAM
publist_id: '4805'
quality_controlled: '1'
scopus_import: 1
status: public
title: On the computational complexity of betti numbers reductions from matrix rank
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2185'
abstract:
- lang: eng
text: 'We revisit the classical problem of converting an imperfect source of randomness
into a usable cryptographic key. Assume that we have some cryptographic application
P that expects a uniformly random m-bit key R and ensures that the best attack
(in some complexity class) against P(R) has success probability at most δ. Our
goal is to design a key-derivation function (KDF) h that converts any random source
X of min-entropy k into a sufficiently "good" key h(X), guaranteeing
that P(h(X)) has comparable security δ′ which is ''close'' to δ. Seeded randomness
extractors provide a generic way to solve this problem for all applications P,
with resulting security δ′ = O(δ), provided that we start with entropy k ≥ m +
2 log (1/δ) - O(1). By a result of Radhakrishnan and Ta-Shma, this bound on k
(called the "RT-bound") is also known to be tight in general. Unfortunately,
in many situations the loss of 2 log (1/δ) bits of entropy is unacceptable. This
motivates the study KDFs with less entropy waste by placing some restrictions
on the source X or the application P. In this work we obtain the following new
positive and negative results in this regard: - Efficient samplability of the
source X does not help beat the RT-bound for general applications. This resolves
the SRT (samplable RT) conjecture of Dachman-Soled et al. [DGKM12] in the affirmative,
and also shows that the existence of computationally-secure extractors beating
the RT-bound implies the existence of one-way functions. - We continue in the
line of work initiated by Barak et al. [BDK+11] and construct new information-theoretic
KDFs which beat the RT-bound for large but restricted classes of applications.
Specifically, we design efficient KDFs that work for all unpredictability applications
P (e.g., signatures, MACs, one-way functions, etc.) and can either: (1) extract
all of the entropy k = m with a very modest security loss δ′ = O(δ·log (1/δ)),
or alternatively, (2) achieve essentially optimal security δ′ = O(δ) with a very
modest entropy loss k ≥ m + loglog (1/δ). In comparison, the best prior results
from [BDK+11] for this class of applications would only guarantee δ′ = O(√δ) when
k = m, and would need k ≥ m + log (1/δ) to get δ′ = O(δ). - The weaker bounds
of [BDK+11] hold for a larger class of so-called "square- friendly"
applications (which includes all unpredictability, but also some important indistinguishability,
applications). Unfortunately, we show that these weaker bounds are tight for the
larger class of applications. - We abstract out a clean, information-theoretic
notion of (k,δ,δ′)- unpredictability extractors, which guarantee "induced"
security δ′ for any δ-secure unpredictability application P, and characterize
the parameters achievable for such unpredictability extractors. Of independent
interest, we also relate this notion to the previously-known notion of (min-entropy)
condensers, and improve the state-of-the-art parameters for such condensers.'
alternative_title:
- LNCS
author:
- first_name: Yevgeniy
full_name: Dodis, Yevgeniy
last_name: Dodis
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Daniel
full_name: Wichs, Daniel
last_name: Wichs
citation:
ama: 'Dodis Y, Pietrzak KZ, Wichs D. Key derivation without entropy waste. In: Nguyen
P, Oswald E, eds. Vol 8441. Springer; 2014:93-110. doi:10.1007/978-3-642-55220-5_6'
apa: 'Dodis, Y., Pietrzak, K. Z., & Wichs, D. (2014). Key derivation without
entropy waste. In P. Nguyen & E. Oswald (Eds.) (Vol. 8441, pp. 93–110). Presented
at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Copenhagen,
Denmark: Springer. https://doi.org/10.1007/978-3-642-55220-5_6'
chicago: Dodis, Yevgeniy, Krzysztof Z Pietrzak, and Daniel Wichs. “Key Derivation
without Entropy Waste.” edited by Phong Nguyen and Elisabeth Oswald, 8441:93–110.
Springer, 2014. https://doi.org/10.1007/978-3-642-55220-5_6.
ieee: 'Y. Dodis, K. Z. Pietrzak, and D. Wichs, “Key derivation without entropy waste,”
presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques,
Copenhagen, Denmark, 2014, vol. 8441, pp. 93–110.'
ista: 'Dodis Y, Pietrzak KZ, Wichs D. 2014. Key derivation without entropy waste.
EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 8441,
93–110.'
mla: Dodis, Yevgeniy, et al. Key Derivation without Entropy Waste. Edited
by Phong Nguyen and Elisabeth Oswald, vol. 8441, Springer, 2014, pp. 93–110, doi:10.1007/978-3-642-55220-5_6.
short: Y. Dodis, K.Z. Pietrzak, D. Wichs, in:, P. Nguyen, E. Oswald (Eds.), Springer,
2014, pp. 93–110.
conference:
end_date: 2014-05-15
location: Copenhagen, Denmark
name: 'EUROCRYPT: Theory and Applications of Cryptographic Techniques'
start_date: 2014-05-11
date_created: 2018-12-11T11:56:12Z
date_published: 2014-04-01T00:00:00Z
date_updated: 2021-01-12T06:55:51Z
day: '01'
ddc:
- '000'
- '004'
department:
- _id: KrPi
doi: 10.1007/978-3-642-55220-5_6
editor:
- first_name: Phong
full_name: Nguyen, Phong
last_name: Nguyen
- first_name: Elisabeth
full_name: Oswald, Elisabeth
last_name: Oswald
file:
- access_level: open_access
checksum: da1aa01221086083b23c92e547b48ff4
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:43Z
date_updated: 2020-07-14T12:45:31Z
file_id: '4705'
file_name: IST-2016-680-v1+1_708.pdf
file_size: 505389
relation: main_file
file_date_updated: 2020-07-14T12:45:31Z
has_accepted_license: '1'
intvolume: ' 8441'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Submitted Version
page: 93 - 110
publication_status: published
publisher: Springer
publist_id: '4795'
pubrep_id: '680'
quality_controlled: '1'
scopus_import: 1
status: public
title: Key derivation without entropy waste
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 8441
year: '2014'
...
---
_id: '2180'
abstract:
- lang: eng
text: Weighted majority votes allow one to combine the output of several classifiers
or voters. MinCq is a recent algorithm for optimizing the weight of each voter
based on the minimization of a theoretical bound over the risk of the vote with
elegant PAC-Bayesian generalization guarantees. However, while it has demonstrated
good performance when combining weak classifiers, MinCq cannot make use of the
useful a priori knowledge that one may have when using a mixture of weak and strong
voters. In this paper, we propose P-MinCq, an extension of MinCq that can incorporate
such knowledge in the form of a constraint over the distribution of the weights,
along with general proofs of convergence that stand in the sample compression
setting for data-dependent voters. The approach is applied to a vote of k-NN classifiers
with a specific modeling of the voters' performance. P-MinCq significantly outperforms
the classic k-NN classifier, a symmetric NN and MinCq using the same voters. We
show that it is also competitive with LMNN, a popular metric learning algorithm,
and that combining both approaches further reduces the error.
acknowledgement: 'This work was funded by the French project SoLSTiCe ANR-13-BS02-01
of the ANR. '
author:
- first_name: Aurélien
full_name: Bellet, Aurélien
last_name: Bellet
- first_name: Amaury
full_name: Habrard, Amaury
last_name: Habrard
- first_name: Emilie
full_name: Morvant, Emilie
id: 4BAC2A72-F248-11E8-B48F-1D18A9856A87
last_name: Morvant
orcid: 0000-0002-8301-7240
- first_name: Marc
full_name: Sebban, Marc
last_name: Sebban
citation:
ama: Bellet A, Habrard A, Morvant E, Sebban M. Learning a priori constrained weighted
majority votes. Machine Learning. 2014;97(1-2):129-154. doi:10.1007/s10994-014-5462-z
apa: Bellet, A., Habrard, A., Morvant, E., & Sebban, M. (2014). Learning a priori
constrained weighted majority votes. Machine Learning. Springer. https://doi.org/10.1007/s10994-014-5462-z
chicago: Bellet, Aurélien, Amaury Habrard, Emilie Morvant, and Marc Sebban. “Learning
a Priori Constrained Weighted Majority Votes.” Machine Learning. Springer,
2014. https://doi.org/10.1007/s10994-014-5462-z.
ieee: A. Bellet, A. Habrard, E. Morvant, and M. Sebban, “Learning a priori constrained
weighted majority votes,” Machine Learning, vol. 97, no. 1–2. Springer,
pp. 129–154, 2014.
ista: Bellet A, Habrard A, Morvant E, Sebban M. 2014. Learning a priori constrained
weighted majority votes. Machine Learning. 97(1–2), 129–154.
mla: Bellet, Aurélien, et al. “Learning a Priori Constrained Weighted Majority Votes.”
Machine Learning, vol. 97, no. 1–2, Springer, 2014, pp. 129–54, doi:10.1007/s10994-014-5462-z.
short: A. Bellet, A. Habrard, E. Morvant, M. Sebban, Machine Learning 97 (2014)
129–154.
date_created: 2018-12-11T11:56:10Z
date_published: 2014-10-01T00:00:00Z
date_updated: 2021-01-12T06:55:49Z
day: '01'
department:
- _id: ChLa
doi: 10.1007/s10994-014-5462-z
ec_funded: 1
intvolume: ' 97'
issue: 1-2
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://hal.archives-ouvertes.fr/hal-01009578/document
month: '10'
oa: 1
oa_version: Submitted Version
page: 129 - 154
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication: Machine Learning
publication_status: published
publisher: Springer
publist_id: '4802'
quality_controlled: '1'
scopus_import: 1
status: public
title: Learning a priori constrained weighted majority votes
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 97
year: '2014'
...
---
_id: '2184'
abstract:
- lang: eng
text: 'Given topological spaces X,Y, a fundamental problem of algebraic topology
is understanding the structure of all continuous maps X→ Y. We consider a computational
version, where X,Y are given as finite simplicial complexes, and the goal is to
compute [X,Y], that is, all homotopy classes of suchmaps.We solve this problem
in the stable range, where for some d ≥ 2, we have dim X ≤ 2d-2 and Y is (d-1)-connected;
in particular, Y can be the d-dimensional sphere Sd. The algorithm combines classical
tools and ideas from homotopy theory (obstruction theory, Postnikov systems, and
simplicial sets) with algorithmic tools from effective algebraic topology (locally
effective simplicial sets and objects with effective homology). In contrast, [X,Y]
is known to be uncomputable for general X,Y, since for X = S1 it includes a well
known undecidable problem: testing triviality of the fundamental group of Y. In
follow-up papers, the algorithm is shown to run in polynomial time for d fixed,
and extended to other problems, such as the extension problem, where we are given
a subspace A ⊂ X and a map A→ Y and ask whether it extends to a map X → Y, or
computing the Z2-index-everything in the stable range. Outside the stable range,
the extension problem is undecidable.'
acknowledgement: The research by M. K. was supported by project GAUK 49209. The research
by M. K. was also supported by project 1M0545 by the Ministry of Education of the
Czech Republic and by Center of Excellence { Inst. for Theor. Comput. Sci., Prague
(project P202/12/G061 of GACR). The research by U. W. was supported by the Swiss
National Science Foundation (SNF Projects 200021-125309, 200020-138230, and PP00P2-138948).
article_number: '17 '
author:
- first_name: Martin
full_name: Čadek, Martin
last_name: Čadek
- first_name: Marek
full_name: Krcál, Marek
id: 33E21118-F248-11E8-B48F-1D18A9856A87
last_name: Krcál
- first_name: Jiří
full_name: Matoušek, Jiří
last_name: Matoušek
- first_name: Francis
full_name: Sergeraert, Francis
last_name: Sergeraert
- first_name: Lukáš
full_name: Vokřínek, Lukáš
last_name: Vokřínek
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: Čadek M, Krcál M, Matoušek J, Sergeraert F, Vokřínek L, Wagner U. Computing
all maps into a sphere. Journal of the ACM. 2014;61(3). doi:10.1145/2597629
apa: Čadek, M., Krcál, M., Matoušek, J., Sergeraert, F., Vokřínek, L., & Wagner,
U. (2014). Computing all maps into a sphere. Journal of the ACM. ACM. https://doi.org/10.1145/2597629
chicago: Čadek, Martin, Marek Krcál, Jiří Matoušek, Francis Sergeraert, Lukáš Vokřínek,
and Uli Wagner. “Computing All Maps into a Sphere.” Journal of the ACM.
ACM, 2014. https://doi.org/10.1145/2597629.
ieee: M. Čadek, M. Krcál, J. Matoušek, F. Sergeraert, L. Vokřínek, and U. Wagner,
“Computing all maps into a sphere,” Journal of the ACM, vol. 61, no. 3.
ACM, 2014.
ista: Čadek M, Krcál M, Matoušek J, Sergeraert F, Vokřínek L, Wagner U. 2014. Computing
all maps into a sphere. Journal of the ACM. 61(3), 17.
mla: Čadek, Martin, et al. “Computing All Maps into a Sphere.” Journal of the
ACM, vol. 61, no. 3, 17, ACM, 2014, doi:10.1145/2597629.
short: M. Čadek, M. Krcál, J. Matoušek, F. Sergeraert, L. Vokřínek, U. Wagner, Journal
of the ACM 61 (2014).
date_created: 2018-12-11T11:56:12Z
date_published: 2014-05-01T00:00:00Z
date_updated: 2021-01-12T06:55:50Z
day: '01'
department:
- _id: UlWa
- _id: HeEd
doi: 10.1145/2597629
intvolume: ' 61'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1105.6257
month: '05'
oa: 1
oa_version: Preprint
publication: Journal of the ACM
publication_status: published
publisher: ACM
publist_id: '4797'
quality_controlled: '1'
scopus_import: 1
status: public
title: Computing all maps into a sphere
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 61
year: '2014'
...
---
_id: '2183'
abstract:
- lang: eng
text: 'We describe a simple adaptive network of coupled chaotic maps. The network
reaches a stationary state (frozen topology) for all values of the coupling parameter,
although the dynamics of the maps at the nodes of the network can be nontrivial.
The structure of the network shows interesting hierarchical properties and in
certain parameter regions the dynamics is polysynchronous: Nodes can be divided
in differently synchronized classes but, contrary to cluster synchronization,
nodes in the same class need not be connected to each other. These complicated
synchrony patterns have been conjectured to play roles in systems biology and
circuits. The adaptive system we study describes ways whereby this behavior can
evolve from undifferentiated nodes.'
acknowledgement: "V.B.S. is partially supported by contract MEC (Grant No. AYA2010-22111-C03-02).\r\n"
article_number: '062809'
article_processing_charge: No
author:
- first_name: Vicente
full_name: Botella Soler, Vicente
id: 421234E8-F248-11E8-B48F-1D18A9856A87
last_name: Botella Soler
orcid: 0000-0002-8790-1914
- first_name: Paul
full_name: Glendinning, Paul
last_name: Glendinning
citation:
ama: Botella Soler V, Glendinning P. Hierarchy and polysynchrony in an adaptive
network . Physical Review E Statistical Nonlinear and Soft Matter Physics.
2014;89(6). doi:10.1103/PhysRevE.89.062809
apa: Botella Soler, V., & Glendinning, P. (2014). Hierarchy and polysynchrony
in an adaptive network . Physical Review E Statistical Nonlinear and Soft Matter
Physics. American Institute of Physics. https://doi.org/10.1103/PhysRevE.89.062809
chicago: Botella Soler, Vicente, and Paul Glendinning. “Hierarchy and Polysynchrony
in an Adaptive Network .” Physical Review E Statistical Nonlinear and Soft
Matter Physics. American Institute of Physics, 2014. https://doi.org/10.1103/PhysRevE.89.062809.
ieee: V. Botella Soler and P. Glendinning, “Hierarchy and polysynchrony in an adaptive
network ,” Physical Review E Statistical Nonlinear and Soft Matter Physics,
vol. 89, no. 6. American Institute of Physics, 2014.
ista: Botella Soler V, Glendinning P. 2014. Hierarchy and polysynchrony in an adaptive
network . Physical Review E Statistical Nonlinear and Soft Matter Physics. 89(6),
062809.
mla: Botella Soler, Vicente, and Paul Glendinning. “Hierarchy and Polysynchrony
in an Adaptive Network .” Physical Review E Statistical Nonlinear and Soft
Matter Physics, vol. 89, no. 6, 062809, American Institute of Physics, 2014,
doi:10.1103/PhysRevE.89.062809.
short: V. Botella Soler, P. Glendinning, Physical Review E Statistical Nonlinear
and Soft Matter Physics 89 (2014).
date_created: 2018-12-11T11:56:11Z
date_published: 2014-06-16T00:00:00Z
date_updated: 2022-08-25T14:04:45Z
day: '16'
department:
- _id: GaTk
doi: 10.1103/PhysRevE.89.062809
ec_funded: 1
intvolume: ' 89'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1403.3209
month: '06'
oa: 1
oa_version: Preprint
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Physical Review E Statistical Nonlinear and Soft Matter Physics
publication_status: published
publisher: American Institute of Physics
publist_id: '4798'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Hierarchy and polysynchrony in an adaptive network '
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 89
year: '2014'
...
---
_id: '2186'
abstract:
- lang: eng
text: We prove the existence of scattering states for the defocusing cubic Gross-Pitaevskii
(GP) hierarchy in ℝ3. Moreover, we show that an exponential energy growth condition
commonly used in the well-posedness theory of the GP hierarchy is, in a specific
sense, necessary. In fact, we prove that without the latter, there exist initial
data for the focusing cubic GP hierarchy for which instantaneous blowup occurs.
author:
- first_name: Thomas
full_name: Chen, Thomas
last_name: Chen
- first_name: Christian
full_name: Hainzl, Christian
last_name: Hainzl
- first_name: Nataša
full_name: Pavlović, Nataša
last_name: Pavlović
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Chen T, Hainzl C, Pavlović N, Seiringer R. On the well-posedness and scattering
for the Gross-Pitaevskii hierarchy via quantum de Finetti. Letters in Mathematical
Physics. 2014;104(7):871-891. doi:10.1007/s11005-014-0693-2
apa: Chen, T., Hainzl, C., Pavlović, N., & Seiringer, R. (2014). On the well-posedness
and scattering for the Gross-Pitaevskii hierarchy via quantum de Finetti. Letters
in Mathematical Physics. Springer. https://doi.org/10.1007/s11005-014-0693-2
chicago: Chen, Thomas, Christian Hainzl, Nataša Pavlović, and Robert Seiringer.
“On the Well-Posedness and Scattering for the Gross-Pitaevskii Hierarchy via Quantum
de Finetti.” Letters in Mathematical Physics. Springer, 2014. https://doi.org/10.1007/s11005-014-0693-2.
ieee: T. Chen, C. Hainzl, N. Pavlović, and R. Seiringer, “On the well-posedness
and scattering for the Gross-Pitaevskii hierarchy via quantum de Finetti,” Letters
in Mathematical Physics, vol. 104, no. 7. Springer, pp. 871–891, 2014.
ista: Chen T, Hainzl C, Pavlović N, Seiringer R. 2014. On the well-posedness and
scattering for the Gross-Pitaevskii hierarchy via quantum de Finetti. Letters
in Mathematical Physics. 104(7), 871–891.
mla: Chen, Thomas, et al. “On the Well-Posedness and Scattering for the Gross-Pitaevskii
Hierarchy via Quantum de Finetti.” Letters in Mathematical Physics, vol.
104, no. 7, Springer, 2014, pp. 871–91, doi:10.1007/s11005-014-0693-2.
short: T. Chen, C. Hainzl, N. Pavlović, R. Seiringer, Letters in Mathematical Physics
104 (2014) 871–891.
date_created: 2018-12-11T11:56:12Z
date_published: 2014-05-07T00:00:00Z
date_updated: 2021-01-12T06:55:51Z
day: '07'
department:
- _id: RoSe
doi: 10.1007/s11005-014-0693-2
intvolume: ' 104'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1311.2136
month: '05'
oa: 1
oa_version: Submitted Version
page: 871 - 891
project:
- _id: 26450934-B435-11E9-9278-68D0E5697425
name: NSERC Postdoctoral fellowship
publication: Letters in Mathematical Physics
publication_status: published
publisher: Springer
publist_id: '4793'
quality_controlled: '1'
scopus_import: 1
status: public
title: On the well-posedness and scattering for the Gross-Pitaevskii hierarchy via
quantum de Finetti
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 104
year: '2014'
...
---
_id: '2187'
abstract:
- lang: eng
text: 'Systems should not only be correct but also robust in the sense that they
behave reasonably in unexpected situations. This article addresses synthesis of
robust reactive systems from temporal specifications. Existing methods allow arbitrary
behavior if assumptions in the specification are violated. To overcome this, we
define two robustness notions, combine them, and show how to enforce them in synthesis.
The first notion applies to safety properties: If safety assumptions are violated
temporarily, we require that the system recovers to normal operation with as few
errors as possible. The second notion requires that, if liveness assumptions are
violated, as many guarantees as possible should be fulfilled nevertheless. We
present a synthesis procedure achieving this for the important class of GR(1)
specifications, and establish complexity bounds. We also present an implementation
of a special case of robustness, and show experimental results.'
article_processing_charge: No
article_type: original
author:
- first_name: Roderick
full_name: Bloem, Roderick
last_name: Bloem
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Karin
full_name: Greimel, Karin
last_name: Greimel
- 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: Georg
full_name: Hofferek, Georg
last_name: Hofferek
- first_name: Barbara
full_name: Jobstmann, Barbara
last_name: Jobstmann
- first_name: Bettina
full_name: Könighofer, Bettina
last_name: Könighofer
- first_name: Robert
full_name: Könighofer, Robert
last_name: Könighofer
citation:
ama: Bloem R, Chatterjee K, Greimel K, et al. Synthesizing robust systems. Acta
Informatica. 2014;51(3-4):193-220. doi:10.1007/s00236-013-0191-5
apa: Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., Hofferek, G., Jobstmann,
B., … Könighofer, R. (2014). Synthesizing robust systems. Acta Informatica.
Springer. https://doi.org/10.1007/s00236-013-0191-5
chicago: Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger,
Georg Hofferek, Barbara Jobstmann, Bettina Könighofer, and Robert Könighofer.
“Synthesizing Robust Systems.” Acta Informatica. Springer, 2014. https://doi.org/10.1007/s00236-013-0191-5.
ieee: R. Bloem et al., “Synthesizing robust systems,” Acta Informatica,
vol. 51, no. 3–4. Springer, pp. 193–220, 2014.
ista: Bloem R, Chatterjee K, Greimel K, Henzinger TA, Hofferek G, Jobstmann B, Könighofer
B, Könighofer R. 2014. Synthesizing robust systems. Acta Informatica. 51(3–4),
193–220.
mla: Bloem, Roderick, et al. “Synthesizing Robust Systems.” Acta Informatica,
vol. 51, no. 3–4, Springer, 2014, pp. 193–220, doi:10.1007/s00236-013-0191-5.
short: R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, G. Hofferek, B. Jobstmann,
B. Könighofer, R. Könighofer, Acta Informatica 51 (2014) 193–220.
date_created: 2018-12-11T11:56:13Z
date_published: 2014-06-01T00:00:00Z
date_updated: 2021-01-12T06:55:51Z
day: '01'
ddc:
- '621'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/s00236-013-0191-5
ec_funded: 1
file:
- access_level: open_access
checksum: d7f560f3d923f0f00aa10a0652f83273
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:44Z
date_updated: 2020-07-14T12:45:31Z
file_id: '5234'
file_name: IST-2012-71-v1+1_Synthesizing_robust_systems.pdf
file_size: 169523
relation: main_file
file_date_updated: 2020-07-14T12:45:31Z
has_accepted_license: '1'
intvolume: ' 51'
issue: 3-4
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 193 - 220
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _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
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication: Acta Informatica
publication_status: published
publisher: Springer
publist_id: '4787'
pubrep_id: '71'
quality_controlled: '1'
scopus_import: 1
status: public
title: Synthesizing robust systems
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 51
year: '2014'
...
---
_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'
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).
date_created: 2018-12-11T11:56:13Z
date_published: 2014-04-16T00:00:00Z
date_updated: 2021-01-12T06:55:52Z
day: '16'
ddc:
- '570'
department:
- _id: JiFr
doi: 10.1098/rsob.140017
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'
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
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)'
date_created: 2018-12-11T11:56:13Z
date_published: 2014-07-01T00:00:00Z
date_updated: 2021-01-12T06:55:52Z
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
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'
date_created: 2018-12-11T11:56:14Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:55:53Z
day: '01'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1007/978-3-319-08867-9_13
ec_funded: 1
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'
status: public
title: 'From LTL to deterministic automata: A safraless compositional approach'
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 8559
year: '2014'
...
---
_id: '2208'
abstract:
- lang: eng
text: 'We propose to detect quadrupole interactions of neutral ultracold atoms via
their induced mean-field shift. We consider a Mott insulator state of spin-polarized
atoms in a two-dimensional optical square lattice. The quadrupole moments of the
atoms are aligned by an external magnetic field. As the alignment angle is varied,
the mean-field shift shows a characteristic angular dependence, which constitutes
the defining signature of the quadrupole interaction. For the 3P2 states of Yb
and Sr atoms, we find a frequency shift of the order of tens of Hertz, which can
be realistically detected in experiment with current technology. We compare our
results to the mean-field shift of a spin-polarized quasi-two-dimensional Fermi
gas in continuum. '
article_number: '043616'
author:
- first_name: Martin
full_name: Lahrz, Martin
last_name: Lahrz
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
- first_name: Klaus
full_name: Sengstock, Klaus
last_name: Sengstock
- first_name: Christoph
full_name: Becker, Christoph
last_name: Becker
- first_name: Ludwig
full_name: Mathey, Ludwig
last_name: Mathey
citation:
ama: Lahrz M, Lemeshko M, Sengstock K, Becker C, Mathey L. Detecting quadrupole
interactions in ultracold Fermi gases. Physical Review A - Atomic, Molecular,
and Optical Physics. 2014;89(4). doi:10.1103/PhysRevA.89.043616
apa: Lahrz, M., Lemeshko, M., Sengstock, K., Becker, C., & Mathey, L. (2014).
Detecting quadrupole interactions in ultracold Fermi gases. Physical Review
A - Atomic, Molecular, and Optical Physics. American Physical Society. https://doi.org/10.1103/PhysRevA.89.043616
chicago: Lahrz, Martin, Mikhail Lemeshko, Klaus Sengstock, Christoph Becker, and
Ludwig Mathey. “Detecting Quadrupole Interactions in Ultracold Fermi Gases.” Physical
Review A - Atomic, Molecular, and Optical Physics. American Physical Society,
2014. https://doi.org/10.1103/PhysRevA.89.043616.
ieee: M. Lahrz, M. Lemeshko, K. Sengstock, C. Becker, and L. Mathey, “Detecting
quadrupole interactions in ultracold Fermi gases,” Physical Review A - Atomic,
Molecular, and Optical Physics, vol. 89, no. 4. American Physical Society,
2014.
ista: Lahrz M, Lemeshko M, Sengstock K, Becker C, Mathey L. 2014. Detecting quadrupole
interactions in ultracold Fermi gases. Physical Review A - Atomic, Molecular,
and Optical Physics. 89(4), 043616.
mla: Lahrz, Martin, et al. “Detecting Quadrupole Interactions in Ultracold Fermi
Gases.” Physical Review A - Atomic, Molecular, and Optical Physics, vol.
89, no. 4, 043616, American Physical Society, 2014, doi:10.1103/PhysRevA.89.043616.
short: M. Lahrz, M. Lemeshko, K. Sengstock, C. Becker, L. Mathey, Physical Review
A - Atomic, Molecular, and Optical Physics 89 (2014).
date_created: 2018-12-11T11:56:20Z
date_published: 2014-04-23T00:00:00Z
date_updated: 2021-01-12T06:55:59Z
day: '23'
doi: 10.1103/PhysRevA.89.043616
extern: '1'
intvolume: ' 89'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1402.0873
month: '04'
oa: 1
oa_version: Submitted Version
publication: Physical Review A - Atomic, Molecular, and Optical Physics
publication_status: published
publisher: American Physical Society
publist_id: '4764'
quality_controlled: '1'
status: public
title: Detecting quadrupole interactions in ultracold Fermi gases
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 89
year: '2014'
...
---
_id: '2214'
abstract:
- lang: eng
text: A hallmark of immune cell trafficking is directional guidance via gradients
of soluble or surface bound chemokines. Vascular endothelial cells produce, transport
and deposit either their own chemokines or chemokines produced by the underlying
stroma. Endothelial heparan sulfate (HS) was suggested to be a critical scaffold
for these chemokine pools, but it is unclear how steep chemokine gradients are
sustained between the lumenal and ablumenal aspects of blood vessels. Addressing
this question by semi-quantitative immunostaining of HS moieties around blood
vessels with a pan anti-HS IgM mAb, we found a striking HS enrichment in the basal
lamina of resting and inflamed post capillary skin venules, as well as in high
endothelial venules (HEVs) of lymph nodes. Staining of skin vessels with a glycocalyx
probe further suggested that their lumenal glycocalyx contains much lower HS density
than their basolateral extracellular matrix (ECM). This polarized HS pattern was
observed also in isolated resting and inflamed microvascular dermal cells. Notably,
progressive skin inflammation resulted in massive ECM deposition and in further
HS enrichment around skin post capillary venules and their associated pericytes.
Inflammation-dependent HS enrichment was not compromised in mice deficient in
the main HS degrading enzyme, heparanase. Our results suggest that the blood vasculature
patterns steep gradients of HS scaffolds between their lumenal and basolateral
endothelial aspects, and that inflammatory processes can further enrich the HS
content nearby inflamed vessels. We propose that chemokine gradients between the
lumenal and ablumenal sides of vessels could be favored by these sharp HS scaffold
gradients.
acknowledgement: Michael Sixt's research is supported by the European Research Council
(ERC Starting grant).
article_number: e85699
author:
- first_name: Liat
full_name: Stoler Barak, Liat
last_name: Stoler Barak
- first_name: Christine
full_name: Moussion, Christine
id: 3356F664-F248-11E8-B48F-1D18A9856A87
last_name: Moussion
- first_name: Elias
full_name: Shezen, Elias
last_name: Shezen
- first_name: Miki
full_name: Hatzav, Miki
last_name: Hatzav
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- first_name: Ronen
full_name: Alon, Ronen
last_name: Alon
citation:
ama: Stoler Barak L, Moussion C, Shezen E, Hatzav M, Sixt MK, Alon R. Blood vessels
pattern heparan sulfate gradients between their apical and basolateral aspects.
PLoS One. 2014;9(1). doi:10.1371/journal.pone.0085699
apa: Stoler Barak, L., Moussion, C., Shezen, E., Hatzav, M., Sixt, M. K., &
Alon, R. (2014). Blood vessels pattern heparan sulfate gradients between their
apical and basolateral aspects. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0085699
chicago: Stoler Barak, Liat, Christine Moussion, Elias Shezen, Miki Hatzav, Michael
K Sixt, and Ronen Alon. “Blood Vessels Pattern Heparan Sulfate Gradients between
Their Apical and Basolateral Aspects.” PLoS One. Public Library of Science,
2014. https://doi.org/10.1371/journal.pone.0085699.
ieee: L. Stoler Barak, C. Moussion, E. Shezen, M. Hatzav, M. K. Sixt, and R. Alon,
“Blood vessels pattern heparan sulfate gradients between their apical and basolateral
aspects,” PLoS One, vol. 9, no. 1. Public Library of Science, 2014.
ista: Stoler Barak L, Moussion C, Shezen E, Hatzav M, Sixt MK, Alon R. 2014. Blood
vessels pattern heparan sulfate gradients between their apical and basolateral
aspects. PLoS One. 9(1), e85699.
mla: Stoler Barak, Liat, et al. “Blood Vessels Pattern Heparan Sulfate Gradients
between Their Apical and Basolateral Aspects.” PLoS One, vol. 9, no. 1,
e85699, Public Library of Science, 2014, doi:10.1371/journal.pone.0085699.
short: L. Stoler Barak, C. Moussion, E. Shezen, M. Hatzav, M.K. Sixt, R. Alon, PLoS
One 9 (2014).
date_created: 2018-12-11T11:56:22Z
date_published: 2014-01-22T00:00:00Z
date_updated: 2021-01-12T06:56:03Z
day: '22'
ddc:
- '570'
department:
- _id: MiSi
doi: 10.1371/journal.pone.0085699
ec_funded: 1
file:
- access_level: open_access
checksum: 84a8033bda2e07e39405f5acc85f4eca
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:07:48Z
date_updated: 2020-07-14T12:45:33Z
file_id: '4646'
file_name: IST-2016-433-v1+1_journal.pone.0085699.pdf
file_size: 12634775
relation: main_file
file_date_updated: 2020-07-14T12:45:33Z
has_accepted_license: '1'
intvolume: ' 9'
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 25A76F58-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '289720'
name: Stromal Cell-immune Cell Interactions in Health and Disease
publication: PLoS One
publication_status: published
publisher: Public Library of Science
publist_id: '4756'
pubrep_id: '433'
quality_controlled: '1'
scopus_import: 1
status: public
title: Blood vessels pattern heparan sulfate gradients between their apical and basolateral
aspects
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: 9
year: '2014'
...
---
_id: '2215'
abstract:
- lang: eng
text: Homologous recombination is crucial for genome stability and for genetic exchange.
Although our knowledge of the principle steps in recombination and its machinery
is well advanced, homology search, the critical step of exploring the genome for
homologous sequences to enable recombination, has remained mostly enigmatic. However,
recent methodological advances have provided considerable new insights into this
fundamental step in recombination that can be integrated into a mechanistic model.
These advances emphasize the importance of genomic proximity and nuclear organization
for homology search and the critical role of homology search mediators in this
process. They also aid our understanding of how homology search might lead to
unwanted and potentially disease-promoting recombination events.
acknowledgement: J.R. was supported by a Boehringer Ingelheim Fonds PhD stipend.
author:
- first_name: Jörg
full_name: Renkawitz, Jörg
id: 3F0587C8-F248-11E8-B48F-1D18A9856A87
last_name: Renkawitz
orcid: 0000-0003-2856-3369
- first_name: Claudio
full_name: Lademann, Claudio
last_name: Lademann
- first_name: Stefan
full_name: Jentsch, Stefan
last_name: Jentsch
citation:
ama: Renkawitz J, Lademann C, Jentsch S. Mechanisms and principles of homology search
during recombination. Nature Reviews Molecular Cell Biology. 2014;15(6):369-383.
doi:10.1038/nrm3805
apa: Renkawitz, J., Lademann, C., & Jentsch, S. (2014). Mechanisms and principles
of homology search during recombination. Nature Reviews Molecular Cell Biology.
Nature Publishing Group. https://doi.org/10.1038/nrm3805
chicago: Renkawitz, Jörg, Claudio Lademann, and Stefan Jentsch. “Mechanisms and
Principles of Homology Search during Recombination.” Nature Reviews Molecular
Cell Biology. Nature Publishing Group, 2014. https://doi.org/10.1038/nrm3805.
ieee: J. Renkawitz, C. Lademann, and S. Jentsch, “Mechanisms and principles of homology
search during recombination,” Nature Reviews Molecular Cell Biology, vol.
15, no. 6. Nature Publishing Group, pp. 369–383, 2014.
ista: Renkawitz J, Lademann C, Jentsch S. 2014. Mechanisms and principles of homology
search during recombination. Nature Reviews Molecular Cell Biology. 15(6), 369–383.
mla: Renkawitz, Jörg, et al. “Mechanisms and Principles of Homology Search during
Recombination.” Nature Reviews Molecular Cell Biology, vol. 15, no. 6,
Nature Publishing Group, 2014, pp. 369–83, doi:10.1038/nrm3805.
short: J. Renkawitz, C. Lademann, S. Jentsch, Nature Reviews Molecular Cell Biology
15 (2014) 369–383.
date_created: 2018-12-11T11:56:22Z
date_published: 2014-05-14T00:00:00Z
date_updated: 2021-01-12T06:56:03Z
day: '14'
department:
- _id: MiSi
doi: 10.1038/nrm3805
intvolume: ' 15'
issue: '6'
language:
- iso: eng
month: '05'
oa_version: None
page: 369 - 383
publication: Nature Reviews Molecular Cell Biology
publication_status: published
publisher: Nature Publishing Group
publist_id: '4755'
quality_controlled: '1'
scopus_import: 1
status: public
title: Mechanisms and principles of homology search during recombination
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2014'
...