---
_id: '2175'
abstract:
- lang: eng
text: The cerebral cortex, the seat of our cognitive abilities, is composed of an
intricate network of billions of excitatory projection and inhibitory interneurons.
Postmitotic cortical neurons are generated by a diverse set of neural stem cell
progenitors within dedicated zones and defined periods of neurogenesis during
embryonic development. Disruptions in neurogenesis can lead to alterations in
the neuronal cytoarchitecture, which is thought to represent a major underlying
cause for several neurological disorders, including microcephaly, autism and epilepsy.
Although a number of signaling pathways regulating neurogenesis have been described,
the precise cellular and molecular mechanisms regulating the functional neural
stem cell properties in cortical neurogenesis remain unclear. Here, we discuss
the most up-to-date strategies to monitor the fundamental mechanistic parameters
of neuronal progenitor proliferation, and recent advances deciphering the logic
and dynamics of neurogenesis.
article_processing_charge: No
author:
- first_name: Maria P
full_name: Postiglione, Maria P
id: 2C67902A-F248-11E8-B48F-1D18A9856A87
last_name: Postiglione
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
citation:
ama: 'Postiglione MP, Hippenmeyer S. Monitoring neurogenesis in the cerebral cortex:
an update. Future Neurology. 2014;9(3):323-340. doi:10.2217/fnl.14.18'
apa: 'Postiglione, M. P., & Hippenmeyer, S. (2014). Monitoring neurogenesis
in the cerebral cortex: an update. Future Neurology. Future Science Group.
https://doi.org/10.2217/fnl.14.18'
chicago: 'Postiglione, Maria P, and Simon Hippenmeyer. “Monitoring Neurogenesis
in the Cerebral Cortex: An Update.” Future Neurology. Future Science Group,
2014. https://doi.org/10.2217/fnl.14.18.'
ieee: 'M. P. Postiglione and S. Hippenmeyer, “Monitoring neurogenesis in the cerebral
cortex: an update,” Future Neurology, vol. 9, no. 3. Future Science Group,
pp. 323–340, 2014.'
ista: 'Postiglione MP, Hippenmeyer S. 2014. Monitoring neurogenesis in the cerebral
cortex: an update. Future Neurology. 9(3), 323–340.'
mla: 'Postiglione, Maria P., and Simon Hippenmeyer. “Monitoring Neurogenesis in
the Cerebral Cortex: An Update.” Future Neurology, vol. 9, no. 3, Future
Science Group, 2014, pp. 323–40, doi:10.2217/fnl.14.18.'
short: M.P. Postiglione, S. Hippenmeyer, Future Neurology 9 (2014) 323–340.
corr_author: '1'
date_created: 2018-12-11T11:56:09Z
date_published: 2014-05-01T00:00:00Z
date_updated: 2025-04-15T07:31:57Z
day: '01'
ddc:
- '570'
department:
- _id: SiHi
doi: 10.2217/fnl.14.18
ec_funded: 1
file:
- access_level: open_access
checksum: ba06659ecadabceec9a37dd8c4586dce
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:25Z
date_updated: 2020-07-14T12:45:31Z
file_id: '4812'
file_name: IST-2016-528-v1+1_fnl.14.18.pdf
file_size: 3848424
relation: main_file
file_date_updated: 2020-07-14T12:45:31Z
fulldoi: https://doi.org/10.2217/fnl.14.18
has_accepted_license: '1'
intvolume: ' 9'
issue: '3'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 323 - 340
project:
- _id: 25D61E48-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '618444'
name: Molecular Mechanisms of Cerebral Cortex Development
publication: Future Neurology
publication_identifier:
eissn:
- 1748-6971
issn:
- 1479-6708
publication_status: published
publisher: Future Science Group
publist_id: '4806'
pubrep_id: '528'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Monitoring neurogenesis in the cerebral cortex: an update'
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9
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.
article_processing_charge: No
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: 2025-09-29T11:36:43Z
day: '29'
department:
- _id: PeJo
doi: 10.1038/nprot.2014.099
external_id:
isi:
- '000337145800020'
fulldoi: https://doi.org/10.1038/nprot.2014.099
intvolume: ' 9'
isi: 1
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 Ã\x9Cbertragung 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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9
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
corr_author: '1'
date_created: 2018-12-11T11:56:09Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2024-10-09T20:55:33Z
day: '01'
department:
- _id: HeEd
doi: 10.1137/1.9781611973402.11
fulldoi: https://doi.org/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: '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.
article_processing_charge: No
arxiv: 1
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: 2025-06-11T07:59:53Z
day: '01'
department:
- _id: CaUh
doi: 10.1007/s13366-013-0178-y
external_id:
arxiv:
- '1204.3070'
fulldoi: https://doi.org/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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 55
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.
article_processing_charge: No
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).
corr_author: '1'
date_created: 2018-12-11T11:56:10Z
date_published: 2014-06-09T00:00:00Z
date_updated: 2025-09-29T11:35:54Z
day: '09'
ddc:
- '570'
department:
- _id: LaEr
doi: 10.1214/ECP.v19-3121
external_id:
isi:
- '000341869300001'
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
fulldoi: https://doi.org/10.1214/ECP.v19-3121
has_accepted_license: '1'
intvolume: ' 19'
isi: 1
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 19
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. '
article_processing_charge: No
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.
corr_author: '1'
date_created: 2018-12-11T11:56:10Z
date_published: 2014-10-01T00:00:00Z
date_updated: 2025-09-29T11:35:24Z
day: '01'
department:
- _id: ChLa
doi: 10.1007/s10994-014-5462-z
ec_funded: 1
external_id:
isi:
- '000341431300007'
fulldoi: https://doi.org/10.1007/s10994-014-5462-z
intvolume: ' 97'
isi: 1
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
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 '
article_processing_charge: No
arxiv: 1
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: 2025-09-29T11:34:15Z
day: '01'
department:
- _id: UlWa
- _id: HeEd
doi: 10.1145/2597629
external_id:
arxiv:
- '1105.6257'
isi:
- '000337201400003'
fulldoi: https://doi.org/10.1145/2597629
intvolume: ' 61'
isi: 1
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 61
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
fulldoi: https://doi.org/10.1007/978-3-642-55220-5_6
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: '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.
article_processing_charge: No
arxiv: 1
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: 2025-09-29T11:33:31Z
day: '07'
department:
- _id: RoSe
doi: 10.1007/s11005-014-0693-2
external_id:
arxiv:
- '1311.2136'
isi:
- '000336412300005'
fulldoi: https://doi.org/10.1007/s11005-014-0693-2
intvolume: ' 104'
isi: 1
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
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: 2025-09-29T11:32:51Z
day: '01'
ddc:
- '621'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/s00236-013-0191-5
ec_funded: 1
external_id:
isi:
- '000335981500004'
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
fulldoi: https://doi.org/10.1007/s00236-013-0191-5
has_accepted_license: '1'
intvolume: ' 51'
isi: 1
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
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'
article_processing_charge: No
author:
- first_name: Urszula
full_name: Kania, Urszula
id: 4AE5C486-F248-11E8-B48F-1D18A9856A87
last_name: Kania
- first_name: Matyas
full_name: Fendrych, Matyas
last_name: Fendrych
- first_name: Jiřĺ
full_name: Friml, Jiřĺ
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Kania U, Fendrych M, Friml J. Polar delivery in plants; commonalities and differences
to animal epithelial cells. Open Biology. 2014;4(APRIL). doi:10.1098/rsob.140017
apa: Kania, U., Fendrych, M., & Friml, J. (2014). Polar delivery in plants;
commonalities and differences to animal epithelial cells. Open Biology.
Royal Society. https://doi.org/10.1098/rsob.140017
chicago: Kania, Urszula, Matyas Fendrych, and Jiří Friml. “Polar Delivery in Plants;
Commonalities and Differences to Animal Epithelial Cells.” Open Biology.
Royal Society, 2014. https://doi.org/10.1098/rsob.140017.
ieee: U. Kania, M. Fendrych, and J. Friml, “Polar delivery in plants; commonalities
and differences to animal epithelial cells,” Open Biology, vol. 4, no.
APRIL. Royal Society, 2014.
ista: Kania U, Fendrych M, Friml J. 2014. Polar delivery in plants; commonalities
and differences to animal epithelial cells. Open Biology. 4(APRIL), 140017.
mla: Kania, Urszula, et al. “Polar Delivery in Plants; Commonalities and Differences
to Animal Epithelial Cells.” Open Biology, vol. 4, no. APRIL, 140017, Royal
Society, 2014, doi:10.1098/rsob.140017.
short: U. Kania, M. Fendrych, J. Friml, Open Biology 4 (2014).
corr_author: '1'
date_created: 2018-12-11T11:56:13Z
date_published: 2014-04-16T00:00:00Z
date_updated: 2025-09-29T11:32:17Z
day: '16'
ddc:
- '570'
department:
- _id: JiFr
doi: 10.1098/rsob.140017
external_id:
isi:
- '000335813800006'
file:
- access_level: open_access
checksum: 2020627feff36cf0799167c84149fa75
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:40Z
date_updated: 2020-07-14T12:45:31Z
file_id: '5025'
file_name: IST-2016-441-v1+1_140017.full.pdf
file_size: 682570
relation: main_file
file_date_updated: 2020-07-14T12:45:31Z
fulldoi: https://doi.org/10.1098/rsob.140017
has_accepted_license: '1'
intvolume: ' 4'
isi: 1
issue: APRIL
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
publication: Open Biology
publication_status: published
publisher: Royal Society
publist_id: '4786'
pubrep_id: '441'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Polar delivery in plants; commonalities and differences to animal epithelial
cells
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 4
year: '2014'
...
---
_id: '2189'
abstract:
- lang: fre
text: En apprentissage automatique, nous parlons d'adaptation de domaine lorsque
les données de test (cibles) et d'apprentissage (sources) sont générées selon
différentes distributions. Nous devons donc développer des algorithmes de classification
capables de s'adapter à une nouvelle distribution, pour laquelle aucune information
sur les étiquettes n'est disponible. Nous attaquons cette problématique sous l'angle
de l'approche PAC-Bayésienne qui se focalise sur l'apprentissage de modèles définis
comme des votes de majorité sur un ensemble de fonctions. Dans ce contexte, nous
introduisons PV-MinCq une version adaptative de l'algorithme (non adaptatif) MinCq.
PV-MinCq suit le principe suivant. Nous transférons les étiquettes sources aux
points cibles proches pour ensuite appliquer MinCq sur l'échantillon cible ``auto-étiqueté''
(justifié par une borne théorique). Plus précisément, nous définissons un auto-étiquetage
non itératif qui se focalise dans les régions où les distributions marginales
source et cible sont les plus similaires. Dans un second temps, nous étudions
l'influence de notre auto-étiquetage pour en déduire une procédure de validation
des hyperparamètres. Finalement, notre approche montre des résultats empiriques
prometteurs.
article_processing_charge: No
author:
- first_name: Emilie
full_name: Morvant, Emilie
id: 4BAC2A72-F248-11E8-B48F-1D18A9856A87
last_name: Morvant
orcid: 0000-0002-8301-7240
citation:
ama: 'Morvant E. Adaptation de domaine de vote de majorité par auto-étiquetage non
itératif. In: Vol 1. Elsevier; 2014:49-58.'
apa: 'Morvant, E. (2014). Adaptation de domaine de vote de majorité par auto-étiquetage
non itératif (Vol. 1, pp. 49–58). Presented at the CAP: Conférence Francophone
sur l’Apprentissage Automatique (Machine Learning French Conference), Saint-Etienne,
France: Elsevier.'
chicago: Morvant, Emilie. “Adaptation de Domaine de Vote de Majorité Par Auto-Étiquetage
Non Itératif,” 1:49–58. Elsevier, 2014.
ieee: 'E. Morvant, “Adaptation de domaine de vote de majorité par auto-étiquetage
non itératif,” presented at the CAP: Conférence Francophone sur l’Apprentissage
Automatique (Machine Learning French Conference), Saint-Etienne, France, 2014,
vol. 1, pp. 49–58.'
ista: 'Morvant E. 2014. Adaptation de domaine de vote de majorité par auto-étiquetage
non itératif. CAP: Conférence Francophone sur l’Apprentissage Automatique (Machine
Learning French Conference) vol. 1, 49–58.'
mla: Morvant, Emilie. Adaptation de Domaine de Vote de Majorité Par Auto-Étiquetage
Non Itératif. Vol. 1, Elsevier, 2014, pp. 49–58.
short: E. Morvant, in:, Elsevier, 2014, pp. 49–58.
conference:
location: Saint-Etienne, France
name: 'CAP: Conférence Francophone sur l''Apprentissage Automatique (Machine Learning
French Conference)'
corr_author: '1'
date_created: 2018-12-11T11:56:13Z
date_published: 2014-07-01T00:00:00Z
date_updated: 2024-10-09T20:55:32Z
day: '01'
department:
- _id: ChLa
intvolume: ' 1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://hal.archives-ouvertes.fr/hal-01005776/
month: '07'
oa: 1
oa_version: Preprint
page: 49-58
publication_status: published
publisher: Elsevier
publist_id: '4785'
quality_controlled: '1'
status: public
title: Adaptation de domaine de vote de majorité par auto-étiquetage non itératif
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2014'
...
---
_id: '2190'
abstract:
- lang: eng
text: We present a new algorithm to construct a (generalized) deterministic Rabin
automaton for an LTL formula φ. The automaton is the product of a master automaton
and an array of slave automata, one for each G-subformula of φ. The slave automaton
for G ψ is in charge of recognizing whether FG ψ holds. As opposed to standard
determinization procedures, the states of all our automata have a clear logical
structure, which allows for various optimizations. Our construction subsumes former
algorithms for fragments of LTL. Experimental results show improvement in the
sizes of the resulting automata compared to existing methods.
acknowledgement: The author is on leave from Faculty of Informatics, Masaryk University,
Czech Republic, and partially supported by the Czech Science Foundation, grant No.
P202/12/G061.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Javier
full_name: Esparza, Javier
last_name: Esparza
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
citation:
ama: 'Esparza J, Kretinsky J. From LTL to deterministic automata: A safraless compositional
approach. In: Vol 8559. Springer; 2014:192-208. doi:10.1007/978-3-319-08867-9_13'
apa: 'Esparza, J., & Kretinsky, J. (2014). From LTL to deterministic automata:
A safraless compositional approach (Vol. 8559, pp. 192–208). Presented at the
CAV: Computer Aided Verification, Springer. https://doi.org/10.1007/978-3-319-08867-9_13'
chicago: 'Esparza, Javier, and Jan Kretinsky. “From LTL to Deterministic Automata:
A Safraless Compositional Approach,” 8559:192–208. Springer, 2014. https://doi.org/10.1007/978-3-319-08867-9_13.'
ieee: 'J. Esparza and J. Kretinsky, “From LTL to deterministic automata: A safraless
compositional approach,” presented at the CAV: Computer Aided Verification, 2014,
vol. 8559, pp. 192–208.'
ista: 'Esparza J, Kretinsky J. 2014. From LTL to deterministic automata: A safraless
compositional approach. CAV: Computer Aided Verification, LNCS, vol. 8559, 192–208.'
mla: 'Esparza, Javier, and Jan Kretinsky. From LTL to Deterministic Automata:
A Safraless Compositional Approach. Vol. 8559, Springer, 2014, pp. 192–208,
doi:10.1007/978-3-319-08867-9_13.'
short: J. Esparza, J. Kretinsky, in:, Springer, 2014, pp. 192–208.
conference:
name: 'CAV: Computer Aided Verification'
corr_author: '1'
date_created: 2018-12-11T11:56:14Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2025-06-11T08:01:04Z
day: '01'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1007/978-3-319-08867-9_13
ec_funded: 1
external_id:
arxiv:
- '1402.3388'
fulldoi: https://doi.org/10.1007/978-3-319-08867-9_13
intvolume: ' 8559'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1402.3388
month: '01'
oa: 1
oa_version: Submitted Version
page: 192 - 208
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication_status: published
publisher: Springer
publist_id: '4784'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'From LTL to deterministic automata: A safraless compositional approach'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8559
year: '2014'
...
---
_id: '1375'
abstract:
- lang: eng
text: 'We consider directed graphs where each edge is labeled with an integer weight
and study the fundamental algorithmic question of computing the value of a cycle
with minimum mean weight. Our contributions are twofold: (1) First we show that
the algorithmic question is reducible to the problem of a logarithmic number of
min-plus matrix multiplications of n×n-matrices, where n is the number of vertices
of the graph. (2) Second, when the weights are nonnegative, we present the first
(1+ε)-approximation algorithm for the problem and the running time of our algorithm
is Õ(nωlog3(nW/ε)/ε),1 where O(nω) is the time required for the classic n×n-matrix
multiplication and W is the maximum value of the weights. With an additional O(log(nW/ε))
factor in space a cycle with approximately optimal weight can be computed within
the same time bound.'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Sebastian
full_name: Krinninger, Sebastian
last_name: Krinninger
- first_name: Veronika
full_name: Loitzenbauer, Veronika
last_name: Loitzenbauer
- first_name: Michael
full_name: Raskin, Michael
last_name: Raskin
citation:
ama: Chatterjee K, Henzinger M, Krinninger S, Loitzenbauer V, Raskin M. Approximating
the minimum cycle mean. Theoretical Computer Science. 2014;547(C):104-116.
doi:10.1016/j.tcs.2014.06.031
apa: Chatterjee, K., Henzinger, M., Krinninger, S., Loitzenbauer, V., & Raskin,
M. (2014). Approximating the minimum cycle mean. Theoretical Computer Science.
Elsevier. https://doi.org/10.1016/j.tcs.2014.06.031
chicago: Chatterjee, Krishnendu, Monika Henzinger, Sebastian Krinninger, Veronika
Loitzenbauer, and Michael Raskin. “Approximating the Minimum Cycle Mean.” Theoretical
Computer Science. Elsevier, 2014. https://doi.org/10.1016/j.tcs.2014.06.031.
ieee: K. Chatterjee, M. Henzinger, S. Krinninger, V. Loitzenbauer, and M. Raskin,
“Approximating the minimum cycle mean,” Theoretical Computer Science, vol.
547, no. C. Elsevier, pp. 104–116, 2014.
ista: Chatterjee K, Henzinger M, Krinninger S, Loitzenbauer V, Raskin M. 2014. Approximating
the minimum cycle mean. Theoretical Computer Science. 547(C), 104–116.
mla: Chatterjee, Krishnendu, et al. “Approximating the Minimum Cycle Mean.” Theoretical
Computer Science, vol. 547, no. C, Elsevier, 2014, pp. 104–16, doi:10.1016/j.tcs.2014.06.031.
short: K. Chatterjee, M. Henzinger, S. Krinninger, V. Loitzenbauer, M. Raskin, Theoretical
Computer Science 547 (2014) 104–116.
date_created: 2018-12-11T11:51:40Z
date_published: 2014-08-28T00:00:00Z
date_updated: 2025-09-29T13:17:21Z
day: '28'
department:
- _id: KrCh
doi: 10.1016/j.tcs.2014.06.031
ec_funded: 1
external_id:
arxiv:
- '1307.4473'
isi:
- '000340694000008'
fulldoi: https://doi.org/10.1016/j.tcs.2014.06.031
intvolume: ' 547'
isi: 1
issue: C
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1307.4473
month: '08'
oa: 1
oa_version: Preprint
page: 104 - 116
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Theoretical Computer Science
publication_status: published
publisher: Elsevier
publist_id: '5836'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Approximating the minimum cycle mean
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 547
year: '2014'
...
---
_id: '1392'
abstract:
- lang: eng
text: Fault-tolerant distributed algorithms play an important role in ensuring the
reliability of many software applications. In this paper we consider distributed
algorithms whose computations are organized in rounds. To verify the correctness
of such algorithms, we reason about (i) properties (such as invariants) of the
state, (ii) the transitions controlled by the algorithm, and (iii) the communication
graph. We introduce a logic that addresses these points, and contains set comprehensions
with cardinality constraints, function symbols to describe the local states of
each process, and a limited form of quantifier alternation to express the verification
conditions. We show its use in automating the verification of consensus algorithms.
In particular, we give a semi-decision procedure for the unsatisfiability problem
of the logic and identify a decidable fragment. We successfully applied our framework
to verify the correctness of a variety of consensus algorithms tolerant to both
benign faults (message loss, process crashes) and value faults (message corruption).
acknowledgement: Supported by the Vienna Science and Technology Fund (WWTF) through
grant PROSEED.
alternative_title:
- LNCS
author:
- first_name: Cezara
full_name: Dragoi, Cezara
id: 2B2B5ED0-F248-11E8-B48F-1D18A9856A87
last_name: Dragoi
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Helmut
full_name: Veith, Helmut
last_name: Veith
- first_name: Josef
full_name: Widder, Josef
last_name: Widder
- first_name: Damien
full_name: Zufferey, Damien
id: 4397AC76-F248-11E8-B48F-1D18A9856A87
last_name: Zufferey
orcid: 0000-0002-3197-8736
citation:
ama: 'Dragoi C, Henzinger TA, Veith H, Widder J, Zufferey D. A logic-based framework
for verifying consensus algorithms. In: Vol 8318. Springer; 2014:161-181. doi:10.1007/978-3-642-54013-4_10'
apa: 'Dragoi, C., Henzinger, T. A., Veith, H., Widder, J., & Zufferey, D. (2014).
A logic-based framework for verifying consensus algorithms (Vol. 8318, pp. 161–181).
Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation,
San Diego, USA: Springer. https://doi.org/10.1007/978-3-642-54013-4_10'
chicago: Dragoi, Cezara, Thomas A Henzinger, Helmut Veith, Josef Widder, and Damien
Zufferey. “A Logic-Based Framework for Verifying Consensus Algorithms,” 8318:161–81.
Springer, 2014. https://doi.org/10.1007/978-3-642-54013-4_10.
ieee: 'C. Dragoi, T. A. Henzinger, H. Veith, J. Widder, and D. Zufferey, “A logic-based
framework for verifying consensus algorithms,” presented at the VMCAI: Verification,
Model Checking and Abstract Interpretation, San Diego, USA, 2014, vol. 8318, pp.
161–181.'
ista: 'Dragoi C, Henzinger TA, Veith H, Widder J, Zufferey D. 2014. A logic-based
framework for verifying consensus algorithms. VMCAI: Verification, Model Checking
and Abstract Interpretation, LNCS, vol. 8318, 161–181.'
mla: Dragoi, Cezara, et al. A Logic-Based Framework for Verifying Consensus Algorithms.
Vol. 8318, Springer, 2014, pp. 161–81, doi:10.1007/978-3-642-54013-4_10.
short: C. Dragoi, T.A. Henzinger, H. Veith, J. Widder, D. Zufferey, in:, Springer,
2014, pp. 161–181.
conference:
end_date: 2014-01-21
location: San Diego, USA
name: 'VMCAI: Verification, Model Checking and Abstract Interpretation'
start_date: 2014-01-19
date_created: 2018-12-11T11:51:45Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:50:22Z
day: '01'
ddc:
- '000'
- '005'
department:
- _id: ToHe
doi: 10.1007/978-3-642-54013-4_10
ec_funded: 1
file:
- access_level: open_access
checksum: bffa33d39be77df0da39defe97eabf84
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:06Z
date_updated: 2020-07-14T12:44:48Z
file_id: '4859'
file_name: IST-2014-179-v1+1_vmcai14.pdf
file_size: 444138
relation: main_file
file_date_updated: 2020-07-14T12:44:48Z
fulldoi: https://doi.org/10.1007/978-3-642-54013-4_10
has_accepted_license: '1'
intvolume: ' 8318'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 161 - 181
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication_status: published
publisher: Springer
publist_id: '5817'
pubrep_id: '179'
quality_controlled: '1'
scopus_import: 1
status: public
title: A logic-based framework for verifying consensus algorithms
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8318
year: '2014'
...
---
_id: '1393'
abstract:
- lang: eng
text: 'Probabilistic programs are usual functional or imperative programs with two
added constructs: (1) the ability to draw values at random from distributions,
and (2) the ability to condition values of variables in a program via observations.
Models from diverse application areas such as computer vision, coding theory,
cryptographic protocols, biology and reliability analysis can be written as probabilistic
programs. Probabilistic inference is the problem of computing an explicit representation
of the probability distribution implicitly specified by a probabilistic program.
Depending on the application, the desired output from inference may vary-we may
want to estimate the expected value of some function f with respect to the distribution,
or the mode of the distribution, or simply a set of samples drawn from the distribution.
In this paper, we describe connections this research area called \Probabilistic
Programming" has with programming languages and software engineering, and
this includes language design, and the static and dynamic analysis of programs.
We survey current state of the art and speculate on promising directions for future
research.'
article_processing_charge: No
author:
- first_name: Andrew
full_name: Gordon, Andrew
last_name: Gordon
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Aditya
full_name: Nori, Aditya
last_name: Nori
- first_name: Sriram
full_name: Rajamani, Sriram
last_name: Rajamani
citation:
ama: 'Gordon A, Henzinger TA, Nori A, Rajamani S. Probabilistic programming. In:
Proceedings of the on Future of Software Engineering. ACM; 2014:167-181.
doi:10.1145/2593882.2593900'
apa: 'Gordon, A., Henzinger, T. A., Nori, A., & Rajamani, S. (2014). Probabilistic
programming. In Proceedings of the on Future of Software Engineering (pp.
167–181). Hyderabad, India: ACM. https://doi.org/10.1145/2593882.2593900'
chicago: Gordon, Andrew, Thomas A Henzinger, Aditya Nori, and Sriram Rajamani. “Probabilistic
Programming.” In Proceedings of the on Future of Software Engineering,
167–81. ACM, 2014. https://doi.org/10.1145/2593882.2593900.
ieee: A. Gordon, T. A. Henzinger, A. Nori, and S. Rajamani, “Probabilistic programming,”
in Proceedings of the on Future of Software Engineering, Hyderabad, India,
2014, pp. 167–181.
ista: 'Gordon A, Henzinger TA, Nori A, Rajamani S. 2014. Probabilistic programming.
Proceedings of the on Future of Software Engineering. FOSE: Future of Software
Engineering, 167–181.'
mla: Gordon, Andrew, et al. “Probabilistic Programming.” Proceedings of the on
Future of Software Engineering, ACM, 2014, pp. 167–81, doi:10.1145/2593882.2593900.
short: A. Gordon, T.A. Henzinger, A. Nori, S. Rajamani, in:, Proceedings of the
on Future of Software Engineering, ACM, 2014, pp. 167–181.
conference:
end_date: 2014-06-07
location: Hyderabad, India
name: 'FOSE: Future of Software Engineering'
start_date: 2014-05-31
date_created: 2018-12-11T11:51:45Z
date_published: 2014-05-31T00:00:00Z
date_updated: 2026-06-18T17:31:28Z
day: '31'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1145/2593882.2593900
ec_funded: 1
fulldoi: https://doi.org/10.1145/2593882.2593900
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1145/2593882.2593900
month: '05'
oa: 1
oa_version: Published Version
page: 167 - 181
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: Proceedings of the on Future of Software Engineering
publication_status: published
publisher: ACM
publist_id: '5816'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Probabilistic programming
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '1507'
abstract:
- lang: eng
text: The Wigner-Dyson-Gaudin-Mehta conjecture asserts that the local eigenvalue
statistics of large real and complex Hermitian matrices with independent, identically
distributed entries are universal in a sense that they depend only on the symmetry
class of the matrix and otherwise are independent of the details of the distribution.
We present the recent solution to this half-century old conjecture. We explain
how stochastic tools, such as the Dyson Brownian motion, and PDE ideas, such as
De Giorgi-Nash-Moser regularity theory, were combined in the solution. We also
show related results for log-gases that represent a universal model for strongly
correlated systems. Finally, in the spirit of Wigner’s original vision, we discuss
the extensions of these universality results to more realistic physical systems
such as random band matrices.
acknowledgement: The author is partially supported by SFB-TR 12 Grant of the German
Research Council.
article_processing_charge: No
arxiv: 1
author:
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
citation:
ama: 'Erdös L. Random matrices, log-gases and Hölder regularity. In: Proceedings
of the International Congress of Mathematicians. Vol 3. International Congress
of Mathematicians; 2014:214-236.'
apa: 'Erdös, L. (2014). Random matrices, log-gases and Hölder regularity. In Proceedings
of the International Congress of Mathematicians (Vol. 3, pp. 214–236). Seoul,
Korea: International Congress of Mathematicians.'
chicago: Erdös, László. “Random Matrices, Log-Gases and Hölder Regularity.” In Proceedings
of the International Congress of Mathematicians, 3:214–36. International Congress
of Mathematicians, 2014.
ieee: L. Erdös, “Random matrices, log-gases and Hölder regularity,” in Proceedings
of the International Congress of Mathematicians, Seoul, Korea, 2014, vol.
3, pp. 214–236.
ista: 'Erdös L. 2014. Random matrices, log-gases and Hölder regularity. Proceedings
of the International Congress of Mathematicians. ICM: International Congress of
Mathematicians vol. 3, 214–236.'
mla: Erdös, László. “Random Matrices, Log-Gases and Hölder Regularity.” Proceedings
of the International Congress of Mathematicians, vol. 3, International Congress
of Mathematicians, 2014, pp. 214–36.
short: L. Erdös, in:, Proceedings of the International Congress of Mathematicians,
International Congress of Mathematicians, 2014, pp. 214–236.
conference:
end_date: 2014-08-21
location: Seoul, Korea
name: 'ICM: International Congress of Mathematicians'
start_date: 2014-08-13
date_created: 2018-12-11T11:52:25Z
date_published: 2014-08-01T00:00:00Z
date_updated: 2025-06-11T07:52:59Z
day: '01'
department:
- _id: LaEr
ec_funded: 1
external_id:
arxiv:
- '1407.5752'
intvolume: ' 3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1407.5752
month: '08'
oa: 1
oa_version: Submitted Version
page: 214 - 236
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Proceedings of the International Congress of Mathematicians
publication_status: published
publisher: International Congress of Mathematicians
publist_id: '5670'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Random matrices, log-gases and Hölder regularity
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3
year: '2014'
...
---
_id: '1516'
abstract:
- lang: eng
text: "We present a rigorous derivation of the BCS gap equation for superfluid fermionic
gases with point interactions. Our starting point is the BCS energy functional,
whose minimizer we investigate in the limit when the range of the interaction
potential goes to zero.\r\n"
article_processing_charge: No
arxiv: 1
author:
- first_name: Gerhard
full_name: Bräunlich, Gerhard
last_name: Bräunlich
- first_name: Christian
full_name: Hainzl, Christian
last_name: Hainzl
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: 'Bräunlich G, Hainzl C, Seiringer R. On the BCS gap equation for superfluid
fermionic gases. In: Proceedings of the QMath12 Conference. World Scientific
Publishing; 2014:127-137. doi:10.1142/9789814618144_0007'
apa: 'Bräunlich, G., Hainzl, C., & Seiringer, R. (2014). On the BCS gap equation
for superfluid fermionic gases. In Proceedings of the QMath12 Conference
(pp. 127–137). Berlin, Germany: World Scientific Publishing. https://doi.org/10.1142/9789814618144_0007'
chicago: Bräunlich, Gerhard, Christian Hainzl, and Robert Seiringer. “On the BCS
Gap Equation for Superfluid Fermionic Gases.” In Proceedings of the QMath12
Conference, 127–37. World Scientific Publishing, 2014. https://doi.org/10.1142/9789814618144_0007.
ieee: G. Bräunlich, C. Hainzl, and R. Seiringer, “On the BCS gap equation for superfluid
fermionic gases,” in Proceedings of the QMath12 Conference, Berlin, Germany,
2014, pp. 127–137.
ista: 'Bräunlich G, Hainzl C, Seiringer R. 2014. On the BCS gap equation for superfluid
fermionic gases. Proceedings of the QMath12 Conference. QMath: Mathematical Results
in Quantum Physics, 127–137.'
mla: Bräunlich, Gerhard, et al. “On the BCS Gap Equation for Superfluid Fermionic
Gases.” Proceedings of the QMath12 Conference, World Scientific Publishing,
2014, pp. 127–37, doi:10.1142/9789814618144_0007.
short: G. Bräunlich, C. Hainzl, R. Seiringer, in:, Proceedings of the QMath12 Conference,
World Scientific Publishing, 2014, pp. 127–137.
conference:
end_date: 2013-09-13
location: Berlin, Germany
name: 'QMath: Mathematical Results in Quantum Physics'
start_date: 2013-09-10
date_created: 2018-12-11T11:52:28Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:51:19Z
day: '01'
department:
- _id: RoSe
doi: 10.1142/9789814618144_0007
external_id:
arxiv:
- '1403.2563'
fulldoi: https://doi.org/10.1142/9789814618144_0007
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1403.2563
month: '01'
oa: 1
oa_version: Preprint
page: 127 - 137
publication: Proceedings of the QMath12 Conference
publication_status: published
publisher: World Scientific Publishing
publist_id: '5661'
quality_controlled: '1'
status: public
title: On the BCS gap equation for superfluid fermionic gases
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '1629'
abstract:
- lang: eng
text: We propose a method for propagating edit operations in 2D vector graphics,
based on geometric relationship functions. These functions quantify the geometric
relationship of a point to a polygon, such as the distance to the boundary or
the direction to the closest corner vertex. The level sets of the relationship
functions describe points with the same relationship to a polygon. For a given
query point, we first determine a set of relationships to local features, construct
all level sets for these relationships, and accumulate them. The maxima of the
resulting distribution are points with similar geometric relationships. We show
extensions to handle mirror symmetries, and discuss the use of relationship functions
as local coordinate systems. Our method can be applied, for example, to interactive
floorplan editing, and it is especially useful for large layouts, where individual
edits would be cumbersome. We demonstrate populating 2D layouts with tens to hundreds
of objects by propagating relatively few edit operations.
article_number: '15'
article_processing_charge: No
author:
- first_name: Paul
full_name: Guerrero, Paul
last_name: Guerrero
- first_name: Stefan
full_name: Jeschke, Stefan
id: 44D6411A-F248-11E8-B48F-1D18A9856A87
last_name: Jeschke
- first_name: Michael
full_name: Wimmer, Michael
last_name: Wimmer
- first_name: Peter
full_name: Wonka, Peter
last_name: Wonka
citation:
ama: Guerrero P, Jeschke S, Wimmer M, Wonka P. Edit propagation using geometric
relationship functions. ACM Transactions on Graphics. 2014;33(2). doi:10.1145/2591010
apa: Guerrero, P., Jeschke, S., Wimmer, M., & Wonka, P. (2014). Edit propagation
using geometric relationship functions. ACM Transactions on Graphics. ACM.
https://doi.org/10.1145/2591010
chicago: Guerrero, Paul, Stefan Jeschke, Michael Wimmer, and Peter Wonka. “Edit
Propagation Using Geometric Relationship Functions.” ACM Transactions on Graphics.
ACM, 2014. https://doi.org/10.1145/2591010.
ieee: P. Guerrero, S. Jeschke, M. Wimmer, and P. Wonka, “Edit propagation using
geometric relationship functions,” ACM Transactions on Graphics, vol. 33,
no. 2. ACM, 2014.
ista: Guerrero P, Jeschke S, Wimmer M, Wonka P. 2014. Edit propagation using geometric
relationship functions. ACM Transactions on Graphics. 33(2), 15.
mla: Guerrero, Paul, et al. “Edit Propagation Using Geometric Relationship Functions.”
ACM Transactions on Graphics, vol. 33, no. 2, 15, ACM, 2014, doi:10.1145/2591010.
short: P. Guerrero, S. Jeschke, M. Wimmer, P. Wonka, ACM Transactions on Graphics
33 (2014).
date_created: 2018-12-11T11:53:08Z
date_published: 2014-03-01T00:00:00Z
date_updated: 2025-09-29T13:16:25Z
day: '01'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/2591010
external_id:
isi:
- '000335009900003'
file:
- access_level: open_access
checksum: 7f91e588a4e888610313b98271e6418e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:22Z
date_updated: 2020-07-14T12:45:07Z
file_id: '4876'
file_name: IST-2016-577-v1+1_2014.TOG.Paul.EditingPropagation.final.pdf
file_size: 9832561
relation: main_file
file_date_updated: 2020-07-14T12:45:07Z
fulldoi: https://doi.org/10.1145/2591010
has_accepted_license: '1'
intvolume: ' 33'
isi: 1
issue: '2'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
publication: ACM Transactions on Graphics
publication_status: published
publisher: ACM
publist_id: '5526'
pubrep_id: '577'
quality_controlled: '1'
status: public
title: Edit propagation using geometric relationship functions
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 33
year: '2014'
...
---
_id: '1643'
abstract:
- lang: eng
text: We extend the notion of verifiable random functions (VRF) to constrained VRFs,
which generalize the concept of constrained pseudorandom functions, put forward
by Boneh and Waters (Asiacrypt’13), and independently by Kiayias et al. (CCS’13)
and Boyle et al. (PKC’14), who call them delegatable PRFs and functional PRFs,
respectively. In a standard VRF the secret key sk allows one to evaluate a pseudorandom
function at any point of its domain; in addition, it enables computation of a
non-interactive proof that the function value was computed correctly. In a constrained
VRF from the key sk one can derive constrained keys skS for subsets S of the domain,
which allow computation of function values and proofs only at points in S. After
formally defining constrained VRFs, we derive instantiations from the multilinear-maps-based
constrained PRFs by Boneh and Waters, yielding a VRF with constrained keys for
any set that can be decided by a polynomial-size circuit. Our VRFs have the same
function values as the Boneh-Waters PRFs and are proved secure under the same
hardness assumption, showing that verifiability comes at no cost. Constrained
(functional) VRFs were stated as an open problem by Boyle et al.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Georg
full_name: Fuchsbauer, Georg
id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
last_name: Fuchsbauer
citation:
ama: 'Fuchsbauer G. Constrained Verifiable Random Functions . In: Abdalla M, De
Prisco R, eds. SCN 2014. Vol 8642. Springer; 2014:95-114. doi:10.1007/978-3-319-10879-7_7'
apa: 'Fuchsbauer, G. (2014). Constrained Verifiable Random Functions . In M. Abdalla
& R. De Prisco (Eds.), SCN 2014 (Vol. 8642, pp. 95–114). Amalfi, Italy:
Springer. https://doi.org/10.1007/978-3-319-10879-7_7'
chicago: Fuchsbauer, Georg. “Constrained Verifiable Random Functions .” In SCN
2014, edited by Michel Abdalla and Roberto De Prisco, 8642:95–114. Springer,
2014. https://doi.org/10.1007/978-3-319-10879-7_7.
ieee: G. Fuchsbauer, “Constrained Verifiable Random Functions ,” in SCN 2014,
Amalfi, Italy, 2014, vol. 8642, pp. 95–114.
ista: 'Fuchsbauer G. 2014. Constrained Verifiable Random Functions . SCN 2014. SCN:
Security and Cryptography for Networks, LNCS, vol. 8642, 95–114.'
mla: Fuchsbauer, Georg. “Constrained Verifiable Random Functions .” SCN 2014,
edited by Michel Abdalla and Roberto De Prisco, vol. 8642, Springer, 2014, pp.
95–114, doi:10.1007/978-3-319-10879-7_7.
short: G. Fuchsbauer, in:, M. Abdalla, R. De Prisco (Eds.), SCN 2014, Springer,
2014, pp. 95–114.
conference:
end_date: 2014-09-05
location: Amalfi, Italy
name: 'SCN: Security and Cryptography for Networks'
start_date: 2014-09-03
corr_author: '1'
cryptoeprintid: 1
das_tickbox: '1'
date_created: 2018-12-11T11:53:13Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2026-06-22T14:10:02Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-319-10879-7_7
ec_funded: 1
editor:
- first_name: Michel
full_name: Abdalla, Michel
last_name: Abdalla
- first_name: Roberto
full_name: De Prisco, Roberto
last_name: De Prisco
external_id:
cryptoeprintid:
- 2014/537
fulldoi: https://doi.org/10.1007/978-3-319-10879-7_7
intvolume: ' 8642'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://eprint.iacr.org/2014/537
month: '01'
oa: 1
oa_version: Submitted Version
page: 95 - 114
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication: SCN 2014
publication_status: published
publisher: Springer
publist_id: '5509'
scopus_import: '1'
status: public
title: 'Constrained Verifiable Random Functions '
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8642
year: '2014'
...