---
_id: '117'
abstract:
- lang: eng
text: The packing arrangement of individual particles inside a granular material
and the resulting response to applied stresses depend critically on particle-particle
interactions. One aspect that recently received attention are nanoscale surface
features of particles, which play an important role in determining the strength
of cohesive van der Waals and capillary interactions and also affect tribo-charging
of grains. We describe experiments on freely falling granular streams that can
detect the contributions from all three of these forces. We show that it is possible
to measure the charge of individual grains and build up distributions that are
detailed enough to provide stringent tests of tribo-charging models currently
available. A second aspect concerns particle shape. In this case steric interactions
become important and new types of aggregate behavior can be expected when non-convex
particle shapes are considered that can interlock or entangle. However, a general
connection between the mechanical response of a granular material and the constituents\'
shape remains unknown. This has made it infeasible to tackle the "inverse
packing problem", namely to start from a given, desired behavior for the
aggregate as a whole and then find the particle shape the produces it. We discuss
a new approach, using concepts rooted in artificial evolution that provides a
way to solve this inverse problem. This approach facilitates exploring the role
of arbitrary particle geometry in jammed systems and invites the discovery and
design of granular matter with optimized properties.
acknowledgement: This work was supported by the NSF MRSEC program under DMR-0820054.
Additional support came from the US Army Research Office through W911NF-12-1-0182.
author:
- first_name: Heinrich
full_name: Jaeger, Heinrich
last_name: Jaeger
- first_name: Marc
full_name: Miskin, Marc
last_name: Miskin
- first_name: Scott R
full_name: Waitukaitis, Scott R
id: 3A1FFC16-F248-11E8-B48F-1D18A9856A87
last_name: Waitukaitis
orcid: 0000-0002-2299-3176
citation:
ama: 'Jaeger H, Miskin M, Waitukaitis SR. From nanoscale cohesion to macroscale
entanglement: opportunities for designing granular aggregate behaviour by tailoring
grain shape and interactions. In: AIP Conference Proceedings. Vol 1542.
AIP; 2013:3-6. doi:10.1063/1.4811858'
apa: 'Jaeger, H., Miskin, M., & Waitukaitis, S. R. (2013). From nanoscale cohesion
to macroscale entanglement: opportunities for designing granular aggregate behaviour
by tailoring grain shape and interactions. In AIP Conference Proceedings
(Vol. 1542, pp. 3–6). Sydney, Australia: AIP. https://doi.org/10.1063/1.4811858'
chicago: 'Jaeger, Heinrich, Marc Miskin, and Scott R Waitukaitis. “From Nanoscale
Cohesion to Macroscale Entanglement: Opportunities for Designing Granular Aggregate
Behaviour by Tailoring Grain Shape and Interactions.” In AIP Conference Proceedings,
1542:3–6. AIP, 2013. https://doi.org/10.1063/1.4811858.'
ieee: 'H. Jaeger, M. Miskin, and S. R. Waitukaitis, “From nanoscale cohesion to
macroscale entanglement: opportunities for designing granular aggregate behaviour
by tailoring grain shape and interactions,” in AIP Conference Proceedings,
Sydney, Australia, 2013, vol. 1542, pp. 3–6.'
ista: 'Jaeger H, Miskin M, Waitukaitis SR. 2013. From nanoscale cohesion to macroscale
entanglement: opportunities for designing granular aggregate behaviour by tailoring
grain shape and interactions. AIP Conference Proceedings. Powders and Grains
vol. 1542, 3–6.'
mla: 'Jaeger, Heinrich, et al. “From Nanoscale Cohesion to Macroscale Entanglement:
Opportunities for Designing Granular Aggregate Behaviour by Tailoring Grain Shape
and Interactions.” AIP Conference Proceedings, vol. 1542, AIP, 2013, pp.
3–6, doi:10.1063/1.4811858.'
short: H. Jaeger, M. Miskin, S.R. Waitukaitis, in:, AIP Conference Proceedings,
AIP, 2013, pp. 3–6.
conference:
end_date: 2013-07-12
location: Sydney, Australia
name: Powders and Grains
start_date: 2013-07-08
date_created: 2018-12-11T11:44:43Z
date_published: 2013-06-01T00:00:00Z
date_updated: 2021-01-12T06:48:49Z
day: '01'
doi: 10.1063/1.4811858
extern: '1'
intvolume: ' 1542'
language:
- iso: eng
month: '06'
oa_version: None
page: 3 - 6
publication: ' AIP Conference Proceedings'
publication_status: published
publisher: AIP
publist_id: '7937'
quality_controlled: '1'
status: public
title: 'From nanoscale cohesion to macroscale entanglement: opportunities for designing
granular aggregate behaviour by tailoring grain shape and interactions'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 1542
year: '2013'
...
---
_id: '11758'
article_processing_charge: No
article_type: letter_note
author:
- first_name: Luca
full_name: Aceto, Luca
last_name: Aceto
- 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: Jiří
full_name: Sgall, Jiří
last_name: Sgall
citation:
ama: Aceto L, Henzinger M, Sgall J. 38th International Colloquium on Automata, Languages
and Programming. Information and Computation. 2013;222(1):1. doi:10.1016/j.ic.2012.11.002
apa: Aceto, L., Henzinger, M., & Sgall, J. (2013). 38th International Colloquium
on Automata, Languages and Programming. Information and Computation. Elsevier.
https://doi.org/10.1016/j.ic.2012.11.002
chicago: Aceto, Luca, Monika Henzinger, and Jiří Sgall. “38th International Colloquium
on Automata, Languages and Programming.” Information and Computation. Elsevier,
2013. https://doi.org/10.1016/j.ic.2012.11.002.
ieee: L. Aceto, M. Henzinger, and J. Sgall, “38th International Colloquium on Automata,
Languages and Programming,” Information and Computation, vol. 222, no.
1. Elsevier, p. 1, 2013.
ista: Aceto L, Henzinger M, Sgall J. 2013. 38th International Colloquium on Automata,
Languages and Programming. Information and Computation. 222(1), 1.
mla: Aceto, Luca, et al. “38th International Colloquium on Automata, Languages and
Programming.” Information and Computation, vol. 222, no. 1, Elsevier, 2013,
p. 1, doi:10.1016/j.ic.2012.11.002.
short: L. Aceto, M. Henzinger, J. Sgall, Information and Computation 222 (2013)
1.
date_created: 2022-08-08T11:25:34Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2024-11-06T12:01:32Z
day: '01'
doi: 10.1016/j.ic.2012.11.002
extern: '1'
intvolume: ' 222'
issue: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: '1'
publication: Information and Computation
publication_identifier:
issn:
- 0890-5401
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: 38th International Colloquium on Automata, Languages and Programming
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 222
year: '2013'
...
---
_id: '11759'
abstract:
- lang: eng
text: Matching markets play a prominent role in economic theory. A prime example
of such a market is the sponsored search market. Here, as in other markets of
that kind, market equilibria correspond to feasible, envy free, and bidder optimal
outcomes. For settings without budgets such an outcome always exists and can be
computed in polynomial-time by the so-called Hungarian Method. Moreover, every
mechanism that computes such an outcome is incentive compatible. We show that
the Hungarian Method can be modified so that it finds a feasible, envy free, and
bidder optimal outcome for settings with budgets. We also show that in settings
with budgets no mechanism that computes such an outcome can be incentive compatible
for all inputs. For inputs in general position, however, the presented mechanism—as
any other mechanism that computes such an outcome for settings with budgets—is
incentive compatible.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Paul
full_name: Dütting, Paul
last_name: Dütting
- 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: Ingmar
full_name: Weber, Ingmar
last_name: Weber
citation:
ama: Dütting P, Henzinger M, Weber I. Sponsored search, market equilibria, and the
Hungarian Method. Information Processing Letters. 2013;113(3):67-73. doi:10.1016/j.ipl.2012.11.006
apa: Dütting, P., Henzinger, M., & Weber, I. (2013). Sponsored search, market
equilibria, and the Hungarian Method. Information Processing Letters. Elsevier.
https://doi.org/10.1016/j.ipl.2012.11.006
chicago: Dütting, Paul, Monika Henzinger, and Ingmar Weber. “Sponsored Search, Market
Equilibria, and the Hungarian Method.” Information Processing Letters.
Elsevier, 2013. https://doi.org/10.1016/j.ipl.2012.11.006.
ieee: P. Dütting, M. Henzinger, and I. Weber, “Sponsored search, market equilibria,
and the Hungarian Method,” Information Processing Letters, vol. 113, no.
3. Elsevier, pp. 67–73, 2013.
ista: Dütting P, Henzinger M, Weber I. 2013. Sponsored search, market equilibria,
and the Hungarian Method. Information Processing Letters. 113(3), 67–73.
mla: Dütting, Paul, et al. “Sponsored Search, Market Equilibria, and the Hungarian
Method.” Information Processing Letters, vol. 113, no. 3, Elsevier, 2013,
pp. 67–73, doi:10.1016/j.ipl.2012.11.006.
short: P. Dütting, M. Henzinger, I. Weber, Information Processing Letters 113 (2013)
67–73.
date_created: 2022-08-08T11:29:08Z
date_published: 2013-02-15T00:00:00Z
date_updated: 2024-11-06T12:09:36Z
day: '15'
doi: 10.1016/j.ipl.2012.11.006
extern: '1'
external_id:
arxiv:
- '0912.1934'
intvolume: ' 113'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/0912.1934
month: '02'
oa: 1
oa_version: Preprint
page: 67-73
publication: Information Processing Letters
publication_identifier:
issn:
- 0020-0190
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sponsored search, market equilibria, and the Hungarian Method
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 113
year: '2013'
...
---
_id: '11791'
abstract:
- lang: eng
text: The focus of classic mechanism design has been on truthful direct-revelation
mechanisms. In the context of combinatorial auctions the truthful direct-revelation
mechanism that maximizes social welfare is the VCG mechanism. For many valuation
spaces computing the allocation and payments of the VCG mechanism, however, is
a computationally hard problem. We thus study the performance of the VCG mechanism
when bidders are forced to choose bids from a subspace of the valuation space
for which the VCG outcome can be computed efficiently. We prove improved upper
bounds on the welfare loss for restrictions to additive bids and upper and lower
bounds for restrictions to non-additive bids. These bounds show that the welfare
loss increases in expressiveness. All our bounds apply to equilibrium concepts
that can be computed in polynomial time as well as to learning outcomes.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Paul
full_name: Dütting, Paul
last_name: Dütting
- 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: Martin
full_name: Starnberger, Martin
last_name: Starnberger
citation:
ama: 'Dütting P, Henzinger M, Starnberger M. Valuation compressions in VCG-based
combinatorial auctions. In: 9th International Conference on Web and Internet
Economics. Vol 8289. Springer Nature; 2013:146–159. doi:10.1007/978-3-642-45046-4_13'
apa: 'Dütting, P., Henzinger, M., & Starnberger, M. (2013). Valuation compressions
in VCG-based combinatorial auctions. In 9th International Conference on Web
and Internet Economics (Vol. 8289, pp. 146–159). Cambridge, MA, USA: Springer
Nature. https://doi.org/10.1007/978-3-642-45046-4_13'
chicago: Dütting, Paul, Monika Henzinger, and Martin Starnberger. “Valuation Compressions
in VCG-Based Combinatorial Auctions.” In 9th International Conference on Web
and Internet Economics, 8289:146–159. Springer Nature, 2013. https://doi.org/10.1007/978-3-642-45046-4_13.
ieee: P. Dütting, M. Henzinger, and M. Starnberger, “Valuation compressions in VCG-based
combinatorial auctions,” in 9th International Conference on Web and Internet
Economics, Cambridge, MA, USA, 2013, vol. 8289, pp. 146–159.
ista: 'Dütting P, Henzinger M, Starnberger M. 2013. Valuation compressions in VCG-based
combinatorial auctions. 9th International Conference on Web and Internet Economics.
WINE: International Conference on Web and Internet Economics, LNCS, vol. 8289,
146–159.'
mla: Dütting, Paul, et al. “Valuation Compressions in VCG-Based Combinatorial Auctions.”
9th International Conference on Web and Internet Economics, vol. 8289,
Springer Nature, 2013, pp. 146–159, doi:10.1007/978-3-642-45046-4_13.
short: P. Dütting, M. Henzinger, M. Starnberger, in:, 9th International Conference
on Web and Internet Economics, Springer Nature, 2013, pp. 146–159.
conference:
end_date: 2013-12-14
location: Cambridge, MA, USA
name: 'WINE: International Conference on Web and Internet Economics'
start_date: 2013-12-01
date_created: 2022-08-11T11:05:14Z
date_published: 2013-12-01T00:00:00Z
date_updated: 2024-11-06T12:12:00Z
day: '01'
doi: 10.1007/978-3-642-45046-4_13
extern: '1'
external_id:
arxiv:
- '1310.3153'
intvolume: ' 8289'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1310.3153
month: '12'
oa: 1
oa_version: Preprint
page: 146–159
publication: 9th International Conference on Web and Internet Economics
publication_identifier:
isbn:
- '9783642450457'
issn:
- 1611-3349
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Valuation compressions in VCG-based combinatorial auctions
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8289
year: '2013'
...
---
_id: '11792'
abstract:
- lang: eng
text: "We study the problem of maximizing a monotone submodular function with viability
constraints. This problem originates from computational biology, where we are
given a phylogenetic tree over a set of species and a directed graph, the so-called
food web, encoding viability constraints between these species. These food webs
usually have constant depth. The goal is to select a subset of k species that
satisfies the viability constraints and has maximal phylogenetic diversity. As
this problem is known to be NP-hard, we investigate approximation algorithm. We
present the first constant factor approximation algorithm if the depth is constant.
Its approximation ratio is (1−1\U0001D452√). This algorithm not only applies to
phylogenetic trees with viability constraints but for arbitrary monotone submodular
set functions with viability constraints. Second, we show that there is no (1 − 1/e + ε)-approximation
algorithm for our problem setting (even for additive functions) and that there
is no approximation algorithm for a slight extension of this setting."
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Wolfgang
full_name: Dvořák, Wolfgang
last_name: Dvořák
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: David P.
full_name: Williamson, David P.
last_name: Williamson
citation:
ama: 'Dvořák W, Henzinger M, Williamson DP. Maximizing a submodular function with
viability constraints. In: 21st Annual European Symposium on Algorithms.
Vol 8125. Springer Nature; 2013:409-420. doi:10.1007/978-3-642-40450-4_35'
apa: 'Dvořák, W., Henzinger, M., & Williamson, D. P. (2013). Maximizing a submodular
function with viability constraints. In 21st Annual European Symposium on Algorithms
(Vol. 8125, pp. 409–420). Sophia Antipolis, France: Springer Nature. https://doi.org/10.1007/978-3-642-40450-4_35'
chicago: Dvořák, Wolfgang, Monika Henzinger, and David P. Williamson. “Maximizing
a Submodular Function with Viability Constraints.” In 21st Annual European
Symposium on Algorithms, 8125:409–20. Springer Nature, 2013. https://doi.org/10.1007/978-3-642-40450-4_35.
ieee: W. Dvořák, M. Henzinger, and D. P. Williamson, “Maximizing a submodular function
with viability constraints,” in 21st Annual European Symposium on Algorithms,
Sophia Antipolis, France, 2013, vol. 8125, pp. 409–420.
ista: 'Dvořák W, Henzinger M, Williamson DP. 2013. Maximizing a submodular function
with viability constraints. 21st Annual European Symposium on Algorithms. ESA:
European Symposium on Algorithms, LNCS, vol. 8125, 409–420.'
mla: Dvořák, Wolfgang, et al. “Maximizing a Submodular Function with Viability Constraints.”
21st Annual European Symposium on Algorithms, vol. 8125, Springer Nature,
2013, pp. 409–20, doi:10.1007/978-3-642-40450-4_35.
short: W. Dvořák, M. Henzinger, D.P. Williamson, in:, 21st Annual European Symposium
on Algorithms, Springer Nature, 2013, pp. 409–420.
conference:
end_date: 2013-09-04
location: Sophia Antipolis, France
name: 'ESA: European Symposium on Algorithms'
start_date: 2013-09-02
date_created: 2022-08-11T11:18:19Z
date_published: 2013-09-01T00:00:00Z
date_updated: 2024-11-06T12:12:13Z
day: '01'
doi: 10.1007/978-3-642-40450-4_35
extern: '1'
external_id:
arxiv:
- '1611.05753'
intvolume: ' 8125'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1611.05753
month: '09'
oa: 1
oa_version: Preprint
page: 409 - 420
publication: 21st Annual European Symposium on Algorithms
publication_identifier:
isbn:
- '9783642404498'
issn:
- 1611-3349
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '11792'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Maximizing a submodular function with viability constraints
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8125
year: '2013'
...
---
_id: '11793'
abstract:
- lang: eng
text: "We study the problem of maintaining a breadth-first spanning tree (BFS tree)
in partially dynamic distributed networks modeling a sequence of either failures
or additions of communication links (but not both). We show (1 + ε)-approximation
algorithms whose amortized time (over some number of link changes) is sublinear
in D, the maximum diameter of the network. This breaks the Θ(D) time bound of
recomputing “from scratch”.\r\n\r\nOur technique also leads to a (1 + ε)-approximate
incremental algorithm for single-source shortest paths (SSSP) in the sequential
(usual RAM) model. Prior to our work, the state of the art was the classic exact
algorithm of [9] that is optimal under some assumptions [27]. Our result is the
first to show that, in the incremental setting, this bound can be beaten in certain
cases if a small approximation is allowed."
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- 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: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
citation:
ama: 'Henzinger M, Krinninger S, Nanongkai D. Sublinear-time maintenance of breadth-first
spanning tree in partially dynamic networks. In: 40th International Colloquium
on Automata, Languages, and Programming. Vol 7966. Springer Nature; 2013:607–619.
doi:10.1007/978-3-642-39212-2_53'
apa: 'Henzinger, M., Krinninger, S., & Nanongkai, D. (2013). Sublinear-time
maintenance of breadth-first spanning tree in partially dynamic networks. In 40th
International Colloquium on Automata, Languages, and Programming (Vol. 7966,
pp. 607–619). Riga, Latvia: Springer Nature. https://doi.org/10.1007/978-3-642-39212-2_53'
chicago: Henzinger, Monika, Sebastian Krinninger, and Danupon Nanongkai. “Sublinear-Time
Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks.” In
40th International Colloquium on Automata, Languages, and Programming,
7966:607–619. Springer Nature, 2013. https://doi.org/10.1007/978-3-642-39212-2_53.
ieee: M. Henzinger, S. Krinninger, and D. Nanongkai, “Sublinear-time maintenance
of breadth-first spanning tree in partially dynamic networks,” in 40th International
Colloquium on Automata, Languages, and Programming, Riga, Latvia, 2013, vol.
7966, pp. 607–619.
ista: 'Henzinger M, Krinninger S, Nanongkai D. 2013. Sublinear-time maintenance
of breadth-first spanning tree in partially dynamic networks. 40th International
Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium
on Automata, Languages, and Programming, LNCS, vol. 7966, 607–619.'
mla: Henzinger, Monika, et al. “Sublinear-Time Maintenance of Breadth-First Spanning
Tree in Partially Dynamic Networks.” 40th International Colloquium on Automata,
Languages, and Programming, vol. 7966, Springer Nature, 2013, pp. 607–619,
doi:10.1007/978-3-642-39212-2_53.
short: M. Henzinger, S. Krinninger, D. Nanongkai, in:, 40th International Colloquium
on Automata, Languages, and Programming, Springer Nature, 2013, pp. 607–619.
conference:
end_date: 2013-07-12
location: Riga, Latvia
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 2013-07-08
date_created: 2022-08-11T11:25:13Z
date_published: 2013-07-01T00:00:00Z
date_updated: 2024-11-06T12:12:27Z
day: '01'
doi: 10.1007/978-3-642-39212-2_53
extern: '1'
external_id:
arxiv:
- '1512.08147'
intvolume: ' 7966'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1512.08147
month: '07'
oa: 1
oa_version: Preprint
page: 607–619
publication: 40th International Colloquium on Automata, Languages, and Programming
publication_identifier:
isbn:
- '9783642392115'
issn:
- 1611-3349
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '11793'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Sublinear-time maintenance of breadth-first spanning tree in partially dynamic
networks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7966
year: '2013'
...
---
_id: '11856'
abstract:
- lang: eng
text: 'We study dynamic (1 + ϵ)-approximation algorithms for the all-pairs shortest
paths problem in unweighted undirected n-node m-edge graphs under edge deletions.
The fastest algorithm for this problem is a randomized algorithm with a total
update time of Ȏ(mn) and constant query time by Roditty and Zwick (FOCS 2004).
The fastest deterministic algorithm is from a 1981 paper by Even and Shiloach
(JACM 1981); it has a total update time of O(mn 2 ) and constant query time. We
improve these results as follows: (1) We present an algorithm with a total update
time of Ȏ(n 5/2 ) and constant query time that has an additive error of two in
addition to the 1 + ϵ multiplicative error. This beats the previous Ȏ(mn) time
when m = Ω(n 3/2 ). Note that the additive error is unavoidable since, even in
the static case, an O(n 3-δ )-time (a so-called truly sub cubic) combinatorial
algorithm with 1 + ϵ multiplicative error cannot have an additive error less than
2 - ϵ, unless we make a major breakthrough for Boolean matrix multiplication (Dor,
Halperin and Zwick FOCS 1996) and many other long-standing problems (Vassilevska
Williams and Williams FOCS 2010). The algorithm can also be turned into a (2 +
ϵ)-approximation algorithm (without an additive error) with the same time guarantees,
improving the recent (3 + ϵ)-approximation algorithm with Ȏ(n 5/2+O(1√(log n))
) running time of Bernstein and Roditty (SODA 2011) in terms of both approximation
and time guarantees. (2) We present a deterministic algorithm with a total update
time of Ȏ(mn) and a query time of O(log log n). The algorithm has a multiplicative
error of 1 + ϵ and gives the first improved deterministic algorithm since 1981.
It also answers an open question raised by Bernstein in his STOC 2013 paper. In
order to achieve our results, we introduce two new techniques: (1) A lazy Even-Shiloach
tree algorithm which maintains a bounded-distance shortest-paths tree on a certain
type of emulator called locally persevering emulator. (2) A derandomization technique
based on moving Even-Shiloach trees as a way to derandomize the standard random
set argument. These techniques might be of independent interest.'
article_processing_charge: No
arxiv: 1
author:
- 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: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
citation:
ama: 'Henzinger M, Krinninger S, Nanongkai D. Dynamic approximate all-pairs shortest
paths: Breaking the O(mn) barrier and derandomization. In: 54th Annual Symposium
on Foundations of Computer Science. Institute of Electrical and Electronics
Engineers; 2013:538-547. doi:10.1109/focs.2013.64'
apa: 'Henzinger, M., Krinninger, S., & Nanongkai, D. (2013). Dynamic approximate
all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. In 54th
Annual Symposium on Foundations of Computer Science (pp. 538–547). Berkeley,
CA, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/focs.2013.64'
chicago: 'Henzinger, Monika, Sebastian Krinninger, and Danupon Nanongkai. “Dynamic
Approximate All-Pairs Shortest Paths: Breaking the O(Mn) Barrier and Derandomization.”
In 54th Annual Symposium on Foundations of Computer Science, 538–47. Institute
of Electrical and Electronics Engineers, 2013. https://doi.org/10.1109/focs.2013.64.'
ieee: 'M. Henzinger, S. Krinninger, and D. Nanongkai, “Dynamic approximate all-pairs
shortest paths: Breaking the O(mn) barrier and derandomization,” in 54th Annual
Symposium on Foundations of Computer Science, Berkeley, CA, United States,
2013, pp. 538–547.'
ista: 'Henzinger M, Krinninger S, Nanongkai D. 2013. Dynamic approximate all-pairs
shortest paths: Breaking the O(mn) barrier and derandomization. 54th Annual Symposium
on Foundations of Computer Science. FOCS: Symposium on Foundations of Computer
Science, 538–547.'
mla: 'Henzinger, Monika, et al. “Dynamic Approximate All-Pairs Shortest Paths: Breaking
the O(Mn) Barrier and Derandomization.” 54th Annual Symposium on Foundations
of Computer Science, Institute of Electrical and Electronics Engineers, 2013,
pp. 538–47, doi:10.1109/focs.2013.64.'
short: M. Henzinger, S. Krinninger, D. Nanongkai, in:, 54th Annual Symposium on
Foundations of Computer Science, Institute of Electrical and Electronics Engineers,
2013, pp. 538–547.
conference:
end_date: 2013-10-29
location: Berkeley, CA, United States
name: 'FOCS: Symposium on Foundations of Computer Science'
start_date: 2013-10-26
date_created: 2022-08-16T08:22:37Z
date_published: 2013-10-01T00:00:00Z
date_updated: 2024-11-06T12:18:28Z
day: '01'
doi: 10.1109/focs.2013.64
extern: '1'
external_id:
arxiv:
- '1308.0776'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1308.0776
month: '10'
oa: 1
oa_version: Preprint
page: 538-547
publication: 54th Annual Symposium on Foundations of Computer Science
publication_identifier:
eisbn:
- 978-0-7695-5135-7
issn:
- 0272-5428
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and
derandomization'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '11902'
abstract:
- lang: eng
text: "We study the problem of matching bidders to items where each bidder i has
general, strictly monotonic utility functions ui,j(pj) expressing his utility
of being matched to item j at price pj. For this setting we prove that a bidder
optimal outcome always exists, even when the utility functions are non-linear
and non-continuous. We give sufficient conditions under\r\nwhich every mechanism
that finds a bidder optimal outcome is incentive compatible. We also give a mechanism
that finds a bidder optimal outcome if the conditions for incentive compatibility
are satisfied. The running time of this mechanism is exponential in the number
of items, but polynomial in the number of bidders."
article_processing_charge: No
article_type: original
author:
- first_name: Paul
full_name: Dütting, Paul
last_name: Dütting
- 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: Ingmar
full_name: Weber, Ingmar
last_name: Weber
citation:
ama: Dütting P, Henzinger M, Weber I. Bidder optimal assignments for general utilities.
Theoretical Computer Science. 2013;478(3):22-32. doi:10.1016/j.tcs.2013.01.030
apa: Dütting, P., Henzinger, M., & Weber, I. (2013). Bidder optimal assignments
for general utilities. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2013.01.030
chicago: Dütting, Paul, Monika Henzinger, and Ingmar Weber. “Bidder Optimal Assignments
for General Utilities.” Theoretical Computer Science. Elsevier, 2013. https://doi.org/10.1016/j.tcs.2013.01.030.
ieee: P. Dütting, M. Henzinger, and I. Weber, “Bidder optimal assignments for general
utilities,” Theoretical Computer Science, vol. 478, no. 3. Elsevier, pp.
22–32, 2013.
ista: Dütting P, Henzinger M, Weber I. 2013. Bidder optimal assignments for general
utilities. Theoretical Computer Science. 478(3), 22–32.
mla: Dütting, Paul, et al. “Bidder Optimal Assignments for General Utilities.” Theoretical
Computer Science, vol. 478, no. 3, Elsevier, 2013, pp. 22–32, doi:10.1016/j.tcs.2013.01.030.
short: P. Dütting, M. Henzinger, I. Weber, Theoretical Computer Science 478 (2013)
22–32.
date_created: 2022-08-17T11:11:04Z
date_published: 2013-03-25T00:00:00Z
date_updated: 2024-11-06T12:24:12Z
day: '25'
doi: 10.1016/j.tcs.2013.01.030
extern: '1'
intvolume: ' 478'
issue: '3'
language:
- iso: eng
month: '03'
oa_version: None
page: 22-32
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '11799'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Bidder optimal assignments for general utilities
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 478
year: '2013'
...
---
_id: '11959'
abstract:
- lang: eng
text: No catalyst required! A highly efficient, catalyst-free process to generate
diimide in situ from hydrazine monohydrate and molecular oxygen for the selective
reduction of alkenes has been developed. The use of a gas–liquid segmented flow
system allowed safe operating conditions and dramatically enhanced this atom-economical
reaction, resulting in short processing times.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Bartholomäus
full_name: Pieber, Bartholomäus
id: 93e5e5b2-0da6-11ed-8a41-af589a024726
last_name: Pieber
orcid: 0000-0001-8689-388X
- first_name: Sabrina Teixeira
full_name: Martinez, Sabrina Teixeira
last_name: Martinez
- first_name: David
full_name: Cantillo, David
last_name: Cantillo
- first_name: C. Oliver
full_name: Kappe, C. Oliver
last_name: Kappe
citation:
ama: 'Pieber B, Martinez ST, Cantillo D, Kappe CO. In situ generation of diimide
from hydrazine and oxygen: Continuous-flow transfer hydrogenation of olefins.
Angewandte Chemie International Edition. 2013;52(39):10241-10244. doi:10.1002/anie.201303528'
apa: 'Pieber, B., Martinez, S. T., Cantillo, D., & Kappe, C. O. (2013). In situ
generation of diimide from hydrazine and oxygen: Continuous-flow transfer hydrogenation
of olefins. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.201303528'
chicago: 'Pieber, Bartholomäus, Sabrina Teixeira Martinez, David Cantillo, and C.
Oliver Kappe. “In Situ Generation of Diimide from Hydrazine and Oxygen: Continuous-Flow
Transfer Hydrogenation of Olefins.” Angewandte Chemie International Edition.
Wiley, 2013. https://doi.org/10.1002/anie.201303528.'
ieee: 'B. Pieber, S. T. Martinez, D. Cantillo, and C. O. Kappe, “In situ generation
of diimide from hydrazine and oxygen: Continuous-flow transfer hydrogenation of
olefins,” Angewandte Chemie International Edition, vol. 52, no. 39. Wiley,
pp. 10241–10244, 2013.'
ista: 'Pieber B, Martinez ST, Cantillo D, Kappe CO. 2013. In situ generation of
diimide from hydrazine and oxygen: Continuous-flow transfer hydrogenation of olefins.
Angewandte Chemie International Edition. 52(39), 10241–10244.'
mla: 'Pieber, Bartholomäus, et al. “In Situ Generation of Diimide from Hydrazine
and Oxygen: Continuous-Flow Transfer Hydrogenation of Olefins.” Angewandte
Chemie International Edition, vol. 52, no. 39, Wiley, 2013, pp. 10241–44,
doi:10.1002/anie.201303528.'
short: B. Pieber, S.T. Martinez, D. Cantillo, C.O. Kappe, Angewandte Chemie International
Edition 52 (2013) 10241–10244.
date_created: 2022-08-24T11:01:47Z
date_published: 2013-09-23T00:00:00Z
date_updated: 2023-02-21T10:09:21Z
day: '23'
doi: 10.1002/anie.201303528
extern: '1'
intvolume: ' 52'
issue: '39'
language:
- iso: eng
month: '09'
oa_version: None
page: 10241-10244
publication: Angewandte Chemie International Edition
publication_identifier:
eissn:
- 1521-3773
issn:
- 1433-7851
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'In situ generation of diimide from hydrazine and oxygen: Continuous-flow transfer
hydrogenation of olefins'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 52
year: '2013'
...
---
_id: '11960'
abstract:
- lang: eng
text: It's not magic! The effects observed in microwave-irradiated chemical transformations
can in most cases be rationalized by purely bulk thermal phenomena associated
with rapid heating to elevated temperatures. As discussed in this Essay, the existence
of so-called nonthermal or specific microwave effects is highly doubtful.
article_processing_charge: No
article_type: letter_note
author:
- first_name: C. Oliver
full_name: Kappe, C. Oliver
last_name: Kappe
- first_name: Bartholomäus
full_name: Pieber, Bartholomäus
id: 93e5e5b2-0da6-11ed-8a41-af589a024726
last_name: Pieber
orcid: 0000-0001-8689-388X
- first_name: Doris
full_name: Dallinger, Doris
last_name: Dallinger
citation:
ama: 'Kappe CO, Pieber B, Dallinger D. Microwave effects in organic synthesis: Myth
or reality? Angewandte Chemie International Edition. 2013;52(4):1088-1094.
doi:10.1002/anie.201204103'
apa: 'Kappe, C. O., Pieber, B., & Dallinger, D. (2013). Microwave effects in
organic synthesis: Myth or reality? Angewandte Chemie International Edition.
Wiley. https://doi.org/10.1002/anie.201204103'
chicago: 'Kappe, C. Oliver, Bartholomäus Pieber, and Doris Dallinger. “Microwave
Effects in Organic Synthesis: Myth or Reality?” Angewandte Chemie International
Edition. Wiley, 2013. https://doi.org/10.1002/anie.201204103.'
ieee: 'C. O. Kappe, B. Pieber, and D. Dallinger, “Microwave effects in organic synthesis:
Myth or reality?,” Angewandte Chemie International Edition, vol. 52, no.
4. Wiley, pp. 1088–1094, 2013.'
ista: 'Kappe CO, Pieber B, Dallinger D. 2013. Microwave effects in organic synthesis:
Myth or reality? Angewandte Chemie International Edition. 52(4), 1088–1094.'
mla: 'Kappe, C. Oliver, et al. “Microwave Effects in Organic Synthesis: Myth or
Reality?” Angewandte Chemie International Edition, vol. 52, no. 4, Wiley,
2013, pp. 1088–94, doi:10.1002/anie.201204103.'
short: C.O. Kappe, B. Pieber, D. Dallinger, Angewandte Chemie International Edition
52 (2013) 1088–1094.
date_created: 2022-08-24T11:05:04Z
date_published: 2013-01-21T00:00:00Z
date_updated: 2023-02-21T10:09:26Z
day: '21'
doi: 10.1002/anie.201204103
extern: '1'
intvolume: ' 52'
issue: '4'
language:
- iso: eng
month: '01'
oa_version: None
page: 1088-1094
publication: Angewandte Chemie International Edition
publication_identifier:
eissn:
- 1521-3773
issn:
- 1433-7851
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Microwave effects in organic synthesis: Myth or reality?'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 52
year: '2013'
...
---
_id: '11973'
abstract:
- lang: eng
text: The use of high-temperature/pressure gas–liquid continuous flow conditions
dramatically enhances the iron-catalyzed aerobic oxidation of 2-benzylpyridines
to their corresponding ketones. Pressurized air serves as a readily available
oxygen source and propylene carbonate as a green solvent in this radically intensified
preparation of synthetically valuable 2-aroylpyridines.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Bartholomäus
full_name: Pieber, Bartholomäus
id: 93e5e5b2-0da6-11ed-8a41-af589a024726
last_name: Pieber
orcid: 0000-0001-8689-388X
- first_name: C. Oliver
full_name: Kappe, C. Oliver
last_name: Kappe
citation:
ama: Pieber B, Kappe CO. Direct aerobic oxidation of 2-benzylpyridines in a gas-liquid
continuous-flow regime using propylene carbonate as a solvent. Green Chemistry.
2013;15(2):320-324. doi:10.1039/c2gc36896j
apa: Pieber, B., & Kappe, C. O. (2013). Direct aerobic oxidation of 2-benzylpyridines
in a gas-liquid continuous-flow regime using propylene carbonate as a solvent.
Green Chemistry. Royal Society of Chemistry. https://doi.org/10.1039/c2gc36896j
chicago: Pieber, Bartholomäus, and C. Oliver Kappe. “Direct Aerobic Oxidation of
2-Benzylpyridines in a Gas-Liquid Continuous-Flow Regime Using Propylene Carbonate
as a Solvent.” Green Chemistry. Royal Society of Chemistry, 2013. https://doi.org/10.1039/c2gc36896j.
ieee: B. Pieber and C. O. Kappe, “Direct aerobic oxidation of 2-benzylpyridines
in a gas-liquid continuous-flow regime using propylene carbonate as a solvent,”
Green Chemistry, vol. 15, no. 2. Royal Society of Chemistry, pp. 320–324,
2013.
ista: Pieber B, Kappe CO. 2013. Direct aerobic oxidation of 2-benzylpyridines in
a gas-liquid continuous-flow regime using propylene carbonate as a solvent. Green
Chemistry. 15(2), 320–324.
mla: Pieber, Bartholomäus, and C. Oliver Kappe. “Direct Aerobic Oxidation of 2-Benzylpyridines
in a Gas-Liquid Continuous-Flow Regime Using Propylene Carbonate as a Solvent.”
Green Chemistry, vol. 15, no. 2, Royal Society of Chemistry, 2013, pp.
320–24, doi:10.1039/c2gc36896j.
short: B. Pieber, C.O. Kappe, Green Chemistry 15 (2013) 320–324.
date_created: 2022-08-25T10:29:21Z
date_published: 2013-02-01T00:00:00Z
date_updated: 2023-02-21T10:09:54Z
day: '01'
doi: 10.1039/c2gc36896j
extern: '1'
intvolume: ' 15'
issue: '2'
language:
- iso: eng
month: '02'
oa_version: None
page: 320-324
publication: Green Chemistry
publication_identifier:
eissn:
- 1463-9270
issn:
- 1463-9262
publication_status: published
publisher: Royal Society of Chemistry
quality_controlled: '1'
scopus_import: '1'
status: public
title: Direct aerobic oxidation of 2-benzylpyridines in a gas-liquid continuous-flow
regime using propylene carbonate as a solvent
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2013'
...
---
_id: '2690'
abstract:
- lang: eng
text: Establishing the spatiotemporal concentration profile of neurotransmitter
following synaptic vesicular release is essential for our understanding of inter-neuronal
communication. Such profile is a determinant of synaptic strength, short-term
plasticity and inter-synaptic crosstalk. Synaptically released glutamate has been
suggested to reach a few millimolar in concentration and last for <1 ms. The
synaptic cleft is often conceived as a single concentration compartment, whereas
a huge gradient likely exists. Modelling studies have attempted to describe this
gradient, but two key parameters, the number of glutamate in a vesicle (NGlu)
and its diffusion coefficient (DGlu) in the extracellular space, remained unresolved.
To determine this profile, the rat calyx of Held synapse at postnatal day 12-16
was studied where diffusion of glutamate occurs two-dimensionally and where quantification
of AMPA receptor distribution on individual postsynaptic specialization on medial
nucleus of the trapezoid body principal cells is possible using SDS-digested freeze-fracture
replica labelling. To assess the performance of these receptors as glutamate sensors,
a kinetic model of the receptors was constructed from outside-out patch recordings.
From here, we simulated synaptic responses and compared them with the EPSC recordings.
Combinations of NGlu and DGlu with an optimum of 7000 and 0.3 μm2 ms-1 reproduced
the data, suggesting slow diffusion. Further simulations showed that a single
vesicle does not saturate the synaptic receptors, and that glutamate spillover
does not affect the conductance amplitude at this synapse. Using the estimated
profile, we also evaluated how the number of multiple vesicle releases at individual
active zones affects the amplitude of postsynaptic signals.
author:
- first_name: Timotheus
full_name: Budisantoso, Timotheus
last_name: Budisantoso
- first_name: Harumi
full_name: Harumi Harada
id: 2E55CDF2-F248-11E8-B48F-1D18A9856A87
last_name: Harada
orcid: 0000-0001-7429-7896
- first_name: Naomi
full_name: Kamasawa, Naomi
last_name: Kamasawa
- first_name: Yugo
full_name: Fukazawa, Yugo
last_name: Fukazawa
- first_name: Ryuichi
full_name: Ryuichi Shigemoto
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Ko
full_name: Matsui, Ko
last_name: Matsui
citation:
ama: Budisantoso T, Harada H, Kamasawa N, Fukazawa Y, Shigemoto R, Matsui K. Evaluation
of glutamate concentration transient in the synaptic cleft of the rat calyx of
Held. Journal of Physiology. 2013;591(1):219-239. doi:10.1113/jphysiol.2012.241398
apa: Budisantoso, T., Harada, H., Kamasawa, N., Fukazawa, Y., Shigemoto, R., &
Matsui, K. (2013). Evaluation of glutamate concentration transient in the synaptic
cleft of the rat calyx of Held. Journal of Physiology. Wiley-Blackwell.
https://doi.org/10.1113/jphysiol.2012.241398
chicago: Budisantoso, Timotheus, Harumi Harada, Naomi Kamasawa, Yugo Fukazawa, Ryuichi
Shigemoto, and Ko Matsui. “Evaluation of Glutamate Concentration Transient in
the Synaptic Cleft of the Rat Calyx of Held.” Journal of Physiology. Wiley-Blackwell,
2013. https://doi.org/10.1113/jphysiol.2012.241398.
ieee: T. Budisantoso, H. Harada, N. Kamasawa, Y. Fukazawa, R. Shigemoto, and K.
Matsui, “Evaluation of glutamate concentration transient in the synaptic cleft
of the rat calyx of Held,” Journal of Physiology, vol. 591, no. 1. Wiley-Blackwell,
pp. 219–239, 2013.
ista: Budisantoso T, Harada H, Kamasawa N, Fukazawa Y, Shigemoto R, Matsui K. 2013.
Evaluation of glutamate concentration transient in the synaptic cleft of the rat
calyx of Held. Journal of Physiology. 591(1), 219–239.
mla: Budisantoso, Timotheus, et al. “Evaluation of Glutamate Concentration Transient
in the Synaptic Cleft of the Rat Calyx of Held.” Journal of Physiology,
vol. 591, no. 1, Wiley-Blackwell, 2013, pp. 219–39, doi:10.1113/jphysiol.2012.241398.
short: T. Budisantoso, H. Harada, N. Kamasawa, Y. Fukazawa, R. Shigemoto, K. Matsui,
Journal of Physiology 591 (2013) 219–239.
date_created: 2018-12-11T11:59:05Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2021-01-12T06:59:04Z
day: '01'
doi: 10.1113/jphysiol.2012.241398
extern: 1
intvolume: ' 591'
issue: '1'
month: '01'
page: 219 - 239
publication: Journal of Physiology
publication_status: published
publisher: Wiley-Blackwell
publist_id: '4207'
quality_controlled: 0
status: public
title: Evaluation of glutamate concentration transient in the synaptic cleft of the
rat calyx of Held
type: journal_article
volume: 591
year: '2013'
...
---
_id: '2691'
abstract:
- lang: eng
text: P/Q-type voltage-dependent calcium channels play key roles in transmitter
release, integration of dendritic signals, generation of dendritic spikes, and
gene expression. High intracellular calcium concentration transient produced by
these channels is restricted to tens to hundreds of nanometers from the channels.
Therefore, precise localization of these channels along the plasma membrane was
long sought to decipher how each neuronal cell function is controlled. Here, we
analyzed the distribution of Cav2.1 subunit of the P/Q-type channel using highly
sensitive SDS-digested freeze-fracture replica labeling in the rat cerebellar
Purkinje cells. The labeling efficiency was such that the number of immunogold
particles in each parallel fiber active zone was comparable to that of functional
channels calculated from previous reports. Two distinct patterns of Cav2.1 distribution,
scattered and clustered, were found in Purkinje cells. The scattered Cav2.1 had
a somatodendritic gradient with the density of immunogold particles increasing
2.5-fold from soma to distal dendrites. The other population with 74-fold higher
density than the scattered particles was found within clusters of intramembrane
particles on the P-face of soma and primary dendrites. Both populations of Cav2.1
were found as early as P3 and increased in the second postnatal week to a mature
level. Using double immunogold labeling, we found that virtually all of the Cav2.1
clusters were colocalized with two types of calcium-activated potassium channels,
BK and SK2, with the nearest neighbor distance of 40∼nm. Calcium nanodomain created
by the opening of Cav2.1 channels likely activates the two channels that limit
the extent of depolarization.
author:
- first_name: Dwi
full_name: Indriati, Dwi Wahyu
last_name: Indriati
- first_name: Naomi
full_name: Kamasawa, Naomi
last_name: Kamasawa
- first_name: Ko
full_name: Matsui, Ko
last_name: Matsui
- first_name: Andrea
full_name: Meredith, Andrea L
last_name: Meredith
- first_name: Masahiko
full_name: Watanabe, Masahiko
last_name: Watanabe
- first_name: Ryuichi
full_name: Ryuichi Shigemoto
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
citation:
ama: 'Indriati D, Kamasawa N, Matsui K, Meredith A, Watanabe M, Shigemoto R. Quantitative
localization of Cav2.1 (P/Q-Type) voltage-dependent calcium channels in Purkinje
cells: Somatodendritic gradient and distinct somatic coclustering with calcium-activated
potassium channels. Journal of Neuroscience. 2013;33(8):3668-3678. doi:10.1523/JNEUROSCI.2921-12.2013'
apa: 'Indriati, D., Kamasawa, N., Matsui, K., Meredith, A., Watanabe, M., &
Shigemoto, R. (2013). Quantitative localization of Cav2.1 (P/Q-Type) voltage-dependent
calcium channels in Purkinje cells: Somatodendritic gradient and distinct somatic
coclustering with calcium-activated potassium channels. Journal of Neuroscience.
Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.2921-12.2013'
chicago: 'Indriati, Dwi, Naomi Kamasawa, Ko Matsui, Andrea Meredith, Masahiko Watanabe,
and Ryuichi Shigemoto. “Quantitative Localization of Cav2.1 (P/Q-Type) Voltage-Dependent
Calcium Channels in Purkinje Cells: Somatodendritic Gradient and Distinct Somatic
Coclustering with Calcium-Activated Potassium Channels.” Journal of Neuroscience.
Society for Neuroscience, 2013. https://doi.org/10.1523/JNEUROSCI.2921-12.2013.'
ieee: 'D. Indriati, N. Kamasawa, K. Matsui, A. Meredith, M. Watanabe, and R. Shigemoto,
“Quantitative localization of Cav2.1 (P/Q-Type) voltage-dependent calcium channels
in Purkinje cells: Somatodendritic gradient and distinct somatic coclustering
with calcium-activated potassium channels,” Journal of Neuroscience, vol.
33, no. 8. Society for Neuroscience, pp. 3668–3678, 2013.'
ista: 'Indriati D, Kamasawa N, Matsui K, Meredith A, Watanabe M, Shigemoto R. 2013.
Quantitative localization of Cav2.1 (P/Q-Type) voltage-dependent calcium channels
in Purkinje cells: Somatodendritic gradient and distinct somatic coclustering
with calcium-activated potassium channels. Journal of Neuroscience. 33(8), 3668–3678.'
mla: 'Indriati, Dwi, et al. “Quantitative Localization of Cav2.1 (P/Q-Type) Voltage-Dependent
Calcium Channels in Purkinje Cells: Somatodendritic Gradient and Distinct Somatic
Coclustering with Calcium-Activated Potassium Channels.” Journal of Neuroscience,
vol. 33, no. 8, Society for Neuroscience, 2013, pp. 3668–78, doi:10.1523/JNEUROSCI.2921-12.2013.'
short: D. Indriati, N. Kamasawa, K. Matsui, A. Meredith, M. Watanabe, R. Shigemoto,
Journal of Neuroscience 33 (2013) 3668–3678.
date_created: 2018-12-11T11:59:05Z
date_published: 2013-02-20T00:00:00Z
date_updated: 2021-01-12T06:59:05Z
day: '20'
doi: 10.1523/JNEUROSCI.2921-12.2013
extern: 1
intvolume: ' 33'
issue: '8'
month: '02'
page: 3668 - 3678
publication: Journal of Neuroscience
publication_status: published
publisher: Society for Neuroscience
publist_id: '4206'
quality_controlled: 0
status: public
title: 'Quantitative localization of Cav2.1 (P/Q-Type) voltage-dependent calcium channels
in Purkinje cells: Somatodendritic gradient and distinct somatic coclustering with
calcium-activated potassium channels'
type: journal_article
volume: 33
year: '2013'
...
---
_id: '2692'
abstract:
- lang: eng
text: The group III metabotropic glutamate (mGlu) receptors mGlu7 and mGlu8 are
receiving increased attention as potential novel therapeutic targets for anxiety
disorders. The effects mediated by these receptors appear to result from a complex
interplay of facilitatory and inhibitory actions at different brain sites in the
anxiety/fear circuits. To better understand the effect of mGlu7 and mGlu8 receptors
on extinction of contextual fear and their critical sites of action in the fear
networks, we focused on the amygdala. Direct injection into the basolateral complex
of the amygdala of the mGlu7 receptor agonist AMN082 facilitated extinction, whereas
the mGlu8 receptor agonist (S)-3,4-DCPG sustained freezing during the extinction
acquisition trial. We also determined at the ultrastructural level the synaptic
distribution of these receptors in the basal nucleus (BA) and intercalated cell
clusters (ITCs) of the amygdala. Both areas are thought to exert key roles in
fear extinction. We demonstrate that mGlu7 and mGlu8 receptors are located in
different presynaptic terminals forming both asymmetric and symmetric synapses,
and that they preferentially target neurons expressing mGlu1α receptors mostly
located around ITCs. In addition we show that mGlu7 and mGlu8 receptors were segregated
to different inputs to a significant extent. In particular, mGlu7a receptors were
primarily onto glutamatergic afferents arising from the BA or midline thalamic
nuclei, but not the medial prefrontal cortex (mPFC), as revealed by combined anterograde
tracing and pre-embedding electron microscopy. On the other hand, mGlu8a showed
a more restricted distribution in the BA and appeared absent from thalamic, mPFC
and intrinsic inputs. This segregation of mGlu7 and mGlu8 receptors in different
neuronal pathways of the fear circuit might explain the distinct effects on fear
extinction training observed with mGlu7 and mGlu8 receptor agonists.
author:
- first_name: Alice
full_name: Dobi, Alice
last_name: Dobi
- first_name: Simone
full_name: Sartori, Simone B
last_name: Sartori
- first_name: Daniela
full_name: Busti, Daniela
last_name: Busti
- first_name: Herman
full_name: Van Der Putten, Herman V
last_name: Van Der Putten
- first_name: Nicolas
full_name: Singewald, Nicolas
last_name: Singewald
- first_name: Ryuichi
full_name: Ryuichi Shigemoto
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Francesco
full_name: Ferraguti, Francesco
last_name: Ferraguti
citation:
ama: Dobi A, Sartori S, Busti D, et al. Neural substrates for the distinct effects
of presynaptic group III metabotropic glutamate receptors on extinction of contextual
fear conditioning in mice. Neuropharmacology. 2013;66:274-289. doi:10.1016/j.neuropharm.2012.05.025
apa: Dobi, A., Sartori, S., Busti, D., Van Der Putten, H., Singewald, N., Shigemoto,
R., & Ferraguti, F. (2013). Neural substrates for the distinct effects of
presynaptic group III metabotropic glutamate receptors on extinction of contextual
fear conditioning in mice. Neuropharmacology. Elsevier. https://doi.org/10.1016/j.neuropharm.2012.05.025
chicago: Dobi, Alice, Simone Sartori, Daniela Busti, Herman Van Der Putten, Nicolas
Singewald, Ryuichi Shigemoto, and Francesco Ferraguti. “Neural Substrates for
the Distinct Effects of Presynaptic Group III Metabotropic Glutamate Receptors
on Extinction of Contextual Fear Conditioning in Mice.” Neuropharmacology.
Elsevier, 2013. https://doi.org/10.1016/j.neuropharm.2012.05.025.
ieee: A. Dobi et al., “Neural substrates for the distinct effects of presynaptic
group III metabotropic glutamate receptors on extinction of contextual fear conditioning
in mice,” Neuropharmacology, vol. 66. Elsevier, pp. 274–289, 2013.
ista: Dobi A, Sartori S, Busti D, Van Der Putten H, Singewald N, Shigemoto R, Ferraguti
F. 2013. Neural substrates for the distinct effects of presynaptic group III metabotropic
glutamate receptors on extinction of contextual fear conditioning in mice. Neuropharmacology.
66, 274–289.
mla: Dobi, Alice, et al. “Neural Substrates for the Distinct Effects of Presynaptic
Group III Metabotropic Glutamate Receptors on Extinction of Contextual Fear Conditioning
in Mice.” Neuropharmacology, vol. 66, Elsevier, 2013, pp. 274–89, doi:10.1016/j.neuropharm.2012.05.025.
short: A. Dobi, S. Sartori, D. Busti, H. Van Der Putten, N. Singewald, R. Shigemoto,
F. Ferraguti, Neuropharmacology 66 (2013) 274–289.
date_created: 2018-12-11T11:59:06Z
date_published: 2013-03-01T00:00:00Z
date_updated: 2021-01-12T06:59:05Z
day: '01'
doi: 10.1016/j.neuropharm.2012.05.025
extern: 1
intvolume: ' 66'
month: '03'
page: 274 - 289
publication: Neuropharmacology
publication_status: published
publisher: Elsevier
publist_id: '4205'
quality_controlled: 0
status: public
title: Neural substrates for the distinct effects of presynaptic group III metabotropic
glutamate receptors on extinction of contextual fear conditioning in mice
type: journal_article
volume: 66
year: '2013'
...
---
_id: '2693'
abstract:
- lang: eng
text: Inhibitory parvalbumin-containing interneurons (PVIs) control neuronal discharge
and support the generation of theta- and gammafrequency oscillations in cortical
networks. Fast GABAergic input onto PVIs is crucial for their synchronization
and oscillatory entrainment, but the role of metabotropic GABAB receptors (GABABRs)
in mediating slow presynaptic and postsynaptic inhibition remains unknown. In
this study, we have combined high-resolution immunoelectron microscopy, whole-cell
patch-clamp recording, and computational modeling to investigate the subcellular
distribution and effects of GABABRs and their postsynaptic effector Kir3 channels
in rat hippocampal PVIs. Pre-embedding immunogold labeling revealed that the receptors
and channels localize at high levels to the extrasynaptic membrane of parvalbumin-immunoreactive
dendrites. Immunoreactivity forGABABRs was also present at lower levels on PVI
axon terminals. Whole-cell recordings further showed that synaptically released
GABA in response to extracellular stimulation evokes large GABABR-mediated slow
IPSCs in perisomatic-targeting (PT) PVIs, but only small or no currents in dendrite-targeting
(DT) PVIs. In contrast, paired recordings demonstrated that GABABR activation
results in presynaptic inhibition at the output synapses of both PT and DT PVIs,
but more strongly in the latter. Finally, computational analysis indicated that
GABAB IPSCs can phasically modulate the discharge of PT interneurons at theta
frequencies. In summary, our results show that GABABRs differentially mediate
slow presynaptic and postsynaptic inhibition in PVIs and can contribute to the
dynamic modulation of their activity during oscillations. Furthermore, these data
provide evidence for a compartment-specific molecular divergence of hippocampal
PVI subtypes, suggesting that activation of GABABRs may shift the balance between
perisomatic and dendritic inhibition.
author:
- first_name: Sam
full_name: Booker, Sam A
last_name: Booker
- first_name: Anna
full_name: Gross, Anna
last_name: Gross
- first_name: Daniel
full_name: Althof, Daniel
last_name: Althof
- first_name: Ryuichi
full_name: Ryuichi Shigemoto
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Bernhard
full_name: Bettler, Bernhard
last_name: Bettler
- first_name: Michael
full_name: Frotscher, Michael
last_name: Frotscher
- first_name: Matthew
full_name: Hearing, Matthew C
last_name: Hearing
- first_name: Kevin
full_name: Wickman, Kevin D
last_name: Wickman
- first_name: Masahiko
full_name: Watanabe, Masahiko
last_name: Watanabe
- first_name: Ákos
full_name: Kulik, Ákos
last_name: Kulik
- first_name: Imre
full_name: Vida, Imre
last_name: Vida
citation:
ama: Booker S, Gross A, Althof D, et al. Differential GABAB-receptor-mediated effects
in perisomatic- and dendrite-targeting parvalbumin interneurons. Journal of
Neuroscience. 2013;33(18):7961-7974. doi:10.1523/JNEUROSCI.1186-12.2013
apa: Booker, S., Gross, A., Althof, D., Shigemoto, R., Bettler, B., Frotscher, M.,
… Vida, I. (2013). Differential GABAB-receptor-mediated effects in perisomatic-
and dendrite-targeting parvalbumin interneurons. Journal of Neuroscience.
Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.1186-12.2013
chicago: Booker, Sam, Anna Gross, Daniel Althof, Ryuichi Shigemoto, Bernhard Bettler,
Michael Frotscher, Matthew Hearing, et al. “Differential GABAB-Receptor-Mediated
Effects in Perisomatic- and Dendrite-Targeting Parvalbumin Interneurons.” Journal
of Neuroscience. Society for Neuroscience, 2013. https://doi.org/10.1523/JNEUROSCI.1186-12.2013.
ieee: S. Booker et al., “Differential GABAB-receptor-mediated effects in
perisomatic- and dendrite-targeting parvalbumin interneurons,” Journal of Neuroscience,
vol. 33, no. 18. Society for Neuroscience, pp. 7961–7974, 2013.
ista: Booker S, Gross A, Althof D, Shigemoto R, Bettler B, Frotscher M, Hearing
M, Wickman K, Watanabe M, Kulik Á, Vida I. 2013. Differential GABAB-receptor-mediated
effects in perisomatic- and dendrite-targeting parvalbumin interneurons. Journal
of Neuroscience. 33(18), 7961–7974.
mla: Booker, Sam, et al. “Differential GABAB-Receptor-Mediated Effects in Perisomatic-
and Dendrite-Targeting Parvalbumin Interneurons.” Journal of Neuroscience,
vol. 33, no. 18, Society for Neuroscience, 2013, pp. 7961–74, doi:10.1523/JNEUROSCI.1186-12.2013.
short: S. Booker, A. Gross, D. Althof, R. Shigemoto, B. Bettler, M. Frotscher, M.
Hearing, K. Wickman, M. Watanabe, Á. Kulik, I. Vida, Journal of Neuroscience 33
(2013) 7961–7974.
date_created: 2018-12-11T11:59:06Z
date_published: 2013-05-01T00:00:00Z
date_updated: 2021-01-12T06:59:05Z
day: '01'
doi: 10.1523/JNEUROSCI.1186-12.2013
extern: 1
intvolume: ' 33'
issue: '18'
month: '05'
page: 7961 - 7974
publication: Journal of Neuroscience
publication_status: published
publisher: Society for Neuroscience
publist_id: '4204'
quality_controlled: 0
status: public
title: Differential GABAB-receptor-mediated effects in perisomatic- and dendrite-targeting
parvalbumin interneurons
type: journal_article
volume: 33
year: '2013'
...
---
_id: '2697'
abstract:
- lang: eng
text: We consider Hermitian and symmetric random band matrices H = (h xy ) in d⩾1
d ⩾ 1 dimensions. The matrix entries h xy , indexed by x,y∈(Z/LZ)d x , y ∈ ( Z
/ L Z ) d , are independent, centred random variables with variances sxy=E|hxy|2
s x y = E | h x y | 2 . We assume that s xy is negligible if |x − y| exceeds the
band width W. In one dimension we prove that the eigenvectors of H are delocalized
if W≫L4/5 W ≫ L 4 / 5 . We also show that the magnitude of the matrix entries
|Gxy|2 | G x y | 2 of the resolvent G=G(z)=(H−z)−1 G = G ( z ) = ( H - z ) - 1
is self-averaging and we compute E|Gxy|2 E | G x y | 2 . We show that, as L→∞
L → ∞ and W≫L4/5 W ≫ L 4 / 5 , the behaviour of E|Gxy|2 E | G x y | 2 is governed
by a diffusion operator whose diffusion constant we compute. Similar results are
obtained in higher dimensions.
author:
- first_name: László
full_name: László Erdös
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Antti
full_name: Knowles, Antti
last_name: Knowles
- first_name: Horng
full_name: Yau, Horng-Tzer
last_name: Yau
- first_name: Jun
full_name: Yin, Jun
last_name: Yin
citation:
ama: Erdös L, Knowles A, Yau H, Yin J. Delocalization and diffusion profile for
random band matrices. Communications in Mathematical Physics. 2013;323(1):367-416.
doi:10.1007/s00220-013-1773-3
apa: Erdös, L., Knowles, A., Yau, H., & Yin, J. (2013). Delocalization and diffusion
profile for random band matrices. Communications in Mathematical Physics.
Springer. https://doi.org/10.1007/s00220-013-1773-3
chicago: Erdös, László, Antti Knowles, Horng Yau, and Jun Yin. “Delocalization and
Diffusion Profile for Random Band Matrices.” Communications in Mathematical
Physics. Springer, 2013. https://doi.org/10.1007/s00220-013-1773-3.
ieee: L. Erdös, A. Knowles, H. Yau, and J. Yin, “Delocalization and diffusion profile
for random band matrices,” Communications in Mathematical Physics, vol.
323, no. 1. Springer, pp. 367–416, 2013.
ista: Erdös L, Knowles A, Yau H, Yin J. 2013. Delocalization and diffusion profile
for random band matrices. Communications in Mathematical Physics. 323(1), 367–416.
mla: Erdös, László, et al. “Delocalization and Diffusion Profile for Random Band
Matrices.” Communications in Mathematical Physics, vol. 323, no. 1, Springer,
2013, pp. 367–416, doi:10.1007/s00220-013-1773-3.
short: L. Erdös, A. Knowles, H. Yau, J. Yin, Communications in Mathematical Physics
323 (2013) 367–416.
date_created: 2018-12-11T11:59:07Z
date_published: 2013-10-01T00:00:00Z
date_updated: 2021-01-12T06:59:07Z
day: '01'
doi: 10.1007/s00220-013-1773-3
extern: 1
intvolume: ' 323'
issue: '1'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1205.5669
month: '10'
oa: 1
page: 367 - 416
publication: Communications in Mathematical Physics
publication_status: published
publisher: Springer
publist_id: '4199'
quality_controlled: 0
status: public
title: Delocalization and diffusion profile for random band matrices
type: journal_article
volume: 323
year: '2013'
...
---
_id: '2698'
abstract:
- lang: eng
text: We consider non-interacting particles subject to a fixed external potential
V and a self-generated magnetic field B. The total energy includes the field energy
β∫B2 and we minimize over all particle states and magnetic fields. In the case
of spin-1/2 particles this minimization leads to the coupled Maxwell-Pauli system.
The parameter β tunes the coupling strength between the field and the particles
and it effectively determines the strength of the field. We investigate the stability
and the semiclassical asymptotics, h→0, of the total ground state energy E(β,h,V).
The relevant parameter measuring the field strength in the semiclassical limit
is κ=βh. We are not able to give the exact leading order semiclassical asymptotics
uniformly in κ or even for fixed κ. We do however give upper and lower bounds
on E with almost matching dependence on κ. In the simultaneous limit h→0 and κ→∞
we show that the standard non-magnetic Weyl asymptotics holds. The same result
also holds for the spinless case, i.e. where the Pauli operator is replaced by
the Schrödinger operator.
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
- first_name: Søren
full_name: Fournais, Søren
last_name: Fournais
- first_name: Jan
full_name: Solovej, Jan
last_name: Solovej
citation:
ama: Erdös L, Fournais S, Solovej J. Stability and semiclassics in self-generated
fields. Journal of the European Mathematical Society. 2013;15(6):2093-2113.
doi:10.4171/JEMS/416
apa: Erdös, L., Fournais, S., & Solovej, J. (2013). Stability and semiclassics
in self-generated fields. Journal of the European Mathematical Society.
European Mathematical Society. https://doi.org/10.4171/JEMS/416
chicago: Erdös, László, Søren Fournais, and Jan Solovej. “Stability and Semiclassics
in Self-Generated Fields.” Journal of the European Mathematical Society.
European Mathematical Society, 2013. https://doi.org/10.4171/JEMS/416.
ieee: L. Erdös, S. Fournais, and J. Solovej, “Stability and semiclassics in self-generated
fields,” Journal of the European Mathematical Society, vol. 15, no. 6.
European Mathematical Society, pp. 2093–2113, 2013.
ista: Erdös L, Fournais S, Solovej J. 2013. Stability and semiclassics in self-generated
fields. Journal of the European Mathematical Society. 15(6), 2093–2113.
mla: Erdös, László, et al. “Stability and Semiclassics in Self-Generated Fields.”
Journal of the European Mathematical Society, vol. 15, no. 6, European
Mathematical Society, 2013, pp. 2093–113, doi:10.4171/JEMS/416.
short: L. Erdös, S. Fournais, J. Solovej, Journal of the European Mathematical Society
15 (2013) 2093–2113.
date_created: 2018-12-11T11:59:07Z
date_published: 2013-10-16T00:00:00Z
date_updated: 2025-09-29T14:09:03Z
day: '16'
department:
- _id: LaEr
doi: 10.4171/JEMS/416
external_id:
arxiv:
- '1105.0506'
isi:
- '000326323400006'
intvolume: ' 15'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1105.0506
month: '10'
oa: 1
oa_version: Preprint
page: 2093 - 2113
publication: Journal of the European Mathematical Society
publication_status: published
publisher: European Mathematical Society
publist_id: '4198'
quality_controlled: '1'
status: public
title: Stability and semiclassics in self-generated fields
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 15
year: '2013'
...
---
_id: '2718'
abstract:
- lang: eng
text: Even though both population and quantitative genetics, and evolutionary computation,
deal with the same questions, they have developed largely independently of each
other. I review key results from each field, emphasising those that apply independently
of the (usually unknown) relation between genotype and phenotype. The infinitesimal
model provides a simple framework for predicting the response of complex traits
to selection, which in biology has proved remarkably successful. This allows one
to choose the schedule of population sizes and selection intensities that will
maximise the response to selection, given that the total number of individuals
realised, C = ∑t Nt, is constrained. This argument shows that for an additive
trait (i.e., determined by the sum of effects of the genes), the optimum population
size and the maximum possible response (i.e., the total change in trait mean)
are both proportional to √C.
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: Tiago
full_name: Paixao, Tiago
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
citation:
ama: 'Barton NH, Paixao T. Can quantitative and population genetics help us understand
evolutionary computation? In: Proceedings of the 15th Annual Conference on
Genetic and Evolutionary Computation. ACM; 2013:1573-1580. doi:10.1145/2463372.2463568'
apa: 'Barton, N. H., & Paixao, T. (2013). Can quantitative and population genetics
help us understand evolutionary computation? In Proceedings of the 15th annual
conference on Genetic and evolutionary computation (pp. 1573–1580). Amsterdam,
Netherlands: ACM. https://doi.org/10.1145/2463372.2463568'
chicago: Barton, Nicholas H, and Tiago Paixao. “Can Quantitative and Population
Genetics Help Us Understand Evolutionary Computation?” In Proceedings of the
15th Annual Conference on Genetic and Evolutionary Computation, 1573–80. ACM,
2013. https://doi.org/10.1145/2463372.2463568.
ieee: N. H. Barton and T. Paixao, “Can quantitative and population genetics help
us understand evolutionary computation?,” in Proceedings of the 15th annual
conference on Genetic and evolutionary computation, Amsterdam, Netherlands,
2013, pp. 1573–1580.
ista: 'Barton NH, Paixao T. 2013. Can quantitative and population genetics help
us understand evolutionary computation? Proceedings of the 15th annual conference
on Genetic and evolutionary computation. GECCO: Genetic and evolutionary computation
conference, 1573–1580.'
mla: Barton, Nicholas H., and Tiago Paixao. “Can Quantitative and Population Genetics
Help Us Understand Evolutionary Computation?” Proceedings of the 15th Annual
Conference on Genetic and Evolutionary Computation, ACM, 2013, pp. 1573–80,
doi:10.1145/2463372.2463568.
short: N.H. Barton, T. Paixao, in:, Proceedings of the 15th Annual Conference on
Genetic and Evolutionary Computation, ACM, 2013, pp. 1573–1580.
conference:
end_date: 2013-07-10
location: Amsterdam, Netherlands
name: 'GECCO: Genetic and evolutionary computation conference'
start_date: 2013-07-06
corr_author: '1'
date_created: 2018-12-11T11:59:14Z
date_published: 2013-07-01T00:00:00Z
date_updated: 2024-10-09T20:55:12Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
- _id: CaGu
doi: 10.1145/2463372.2463568
ec_funded: 1
file:
- access_level: open_access
checksum: 9d9be9090ce5c20766e0eb076ace5b98
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:38Z
date_updated: 2020-07-14T12:45:45Z
file_id: '5159'
file_name: IST-2016-564-v1+1_NickGECCO_2013_1_-1.pdf
file_size: 475844
relation: main_file
file_date_updated: 2020-07-14T12:45:45Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 1573 - 1580
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: Proceedings of the 15th annual conference on Genetic and evolutionary
computation
publication_status: published
publisher: ACM
publist_id: '4174'
pubrep_id: '564'
quality_controlled: '1'
scopus_import: 1
status: public
title: Can quantitative and population genetics help us understand evolutionary computation?
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '2719'
abstract:
- lang: eng
text: Prediction of the evolutionary process is a long standing problem both in
the theory of evolutionary biology and evolutionary computation (EC). It has long
been realized that heritable variation is crucial to both the response to selection
and the success of genetic algorithms. However, not all variation contributes
in the same way to the response. Quantitative genetics has developed a large body
of work trying to estimate and understand how different components of the variance
in fitness in the population contribute to the response to selection. We illustrate
how to apply some concepts of quantitative genetics to the analysis of genetic
algorithms. In particular, we derive estimates for the short term prediction of
the response to selection and we use variance decomposition to gain insight on
local aspects of the landscape. Finally, we propose a new population based genetic
algorithm that uses these methods to improve its operation.
author:
- first_name: Tiago
full_name: Paixao, Tiago
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: 'Paixao T, Barton NH. A variance decomposition approach to the analysis of
genetic algorithms. In: Proceedings of the 15th Annual Conference on Genetic
and Evolutionary Computation. ACM; 2013:845-852. doi:10.1145/2463372.2463470'
apa: 'Paixao, T., & Barton, N. H. (2013). A variance decomposition approach
to the analysis of genetic algorithms. In Proceedings of the 15th annual conference
on Genetic and evolutionary computation (pp. 845–852). Amsterdam, Netherlands:
ACM. https://doi.org/10.1145/2463372.2463470'
chicago: Paixao, Tiago, and Nicholas H Barton. “A Variance Decomposition Approach
to the Analysis of Genetic Algorithms.” In Proceedings of the 15th Annual Conference
on Genetic and Evolutionary Computation, 845–52. ACM, 2013. https://doi.org/10.1145/2463372.2463470.
ieee: T. Paixao and N. H. Barton, “A variance decomposition approach to the analysis
of genetic algorithms,” in Proceedings of the 15th annual conference on Genetic
and evolutionary computation, Amsterdam, Netherlands, 2013, pp. 845–852.
ista: 'Paixao T, Barton NH. 2013. A variance decomposition approach to the analysis
of genetic algorithms. Proceedings of the 15th annual conference on Genetic and
evolutionary computation. GECCO: Genetic and evolutionary computation conference,
845–852.'
mla: Paixao, Tiago, and Nicholas H. Barton. “A Variance Decomposition Approach to
the Analysis of Genetic Algorithms.” Proceedings of the 15th Annual Conference
on Genetic and Evolutionary Computation, ACM, 2013, pp. 845–52, doi:10.1145/2463372.2463470.
short: T. Paixao, N.H. Barton, in:, Proceedings of the 15th Annual Conference on
Genetic and Evolutionary Computation, ACM, 2013, pp. 845–852.
conference:
end_date: 2013-07-10
location: Amsterdam, Netherlands
name: 'GECCO: Genetic and evolutionary computation conference'
start_date: 2013-07-06
corr_author: '1'
date_created: 2018-12-11T11:59:15Z
date_published: 2013-07-01T00:00:00Z
date_updated: 2024-10-09T20:55:12Z
day: '01'
department:
- _id: NiBa
- _id: CaGu
doi: 10.1145/2463372.2463470
ec_funded: 1
language:
- iso: eng
month: '07'
oa_version: None
page: 845 - 852
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: Proceedings of the 15th annual conference on Genetic and evolutionary
computation
publication_status: published
publisher: ACM
publist_id: '4173'
quality_controlled: '1'
scopus_import: 1
status: public
title: A variance decomposition approach to the analysis of genetic algorithms
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '2720'
abstract:
- lang: eng
text: 'Knowledge of the rate and fitness effects of mutations is essential for understanding
the process of evolution. Mutations are inherently difficult to study because
they are rare and are frequently eliminated by natural selection. In the ciliate
Tetrahymena thermophila, mutations can accumulate in the germline genome without
being exposed to selection. We have conducted a mutation accumulation (MA) experiment
in this species. Assuming that all mutations are deleterious and have the same
effect, we estimate that the deleterious mutation rate per haploid germline genome
per generation is U = 0.0047 (95% credible interval: 0.0015, 0.0125), and that
germline mutations decrease fitness by s = 11% when expressed in a homozygous
state (95% CI: 4.4%, 27%). We also estimate that deleterious mutations are partially
recessive on average (h = 0.26; 95% CI: –0.022, 0.62) and that the rate of lethal
mutations is <10% of the deleterious mutation rate. Comparisons between the
observed evolutionary responses in the germline and somatic genomes and the results
from individual-based simulations of MA suggest that the two genomes have similar
mutational parameters. These are the first estimates of the deleterious mutation
rate and fitness effects from the eukaryotic supergroup Chromalveolata and are
within the range of those of other eukaryotes.'
article_processing_charge: No
author:
- first_name: Hongan
full_name: Long, Hongan
last_name: Long
- first_name: Tiago
full_name: Paixao, Tiago
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
- first_name: Ricardo
full_name: Azevedo, Ricardo
last_name: Azevedo
- first_name: Rebecca
full_name: Zufall, Rebecca
last_name: Zufall
citation:
ama: Long H, Paixao T, Azevedo R, Zufall R. Accumulation of spontaneous mutations
in the ciliate Tetrahymena thermophila. Genetics. 2013;195(2):527-540.
doi:10.1534/genetics.113.153536
apa: Long, H., Paixao, T., Azevedo, R., & Zufall, R. (2013). Accumulation of
spontaneous mutations in the ciliate Tetrahymena thermophila. Genetics.
Genetics Society of America. https://doi.org/10.1534/genetics.113.153536
chicago: Long, Hongan, Tiago Paixao, Ricardo Azevedo, and Rebecca Zufall. “Accumulation
of Spontaneous Mutations in the Ciliate Tetrahymena Thermophila.” Genetics.
Genetics Society of America, 2013. https://doi.org/10.1534/genetics.113.153536.
ieee: H. Long, T. Paixao, R. Azevedo, and R. Zufall, “Accumulation of spontaneous
mutations in the ciliate Tetrahymena thermophila,” Genetics, vol. 195,
no. 2. Genetics Society of America, pp. 527–540, 2013.
ista: Long H, Paixao T, Azevedo R, Zufall R. 2013. Accumulation of spontaneous mutations
in the ciliate Tetrahymena thermophila. Genetics. 195(2), 527–540.
mla: Long, Hongan, et al. “Accumulation of Spontaneous Mutations in the Ciliate
Tetrahymena Thermophila.” Genetics, vol. 195, no. 2, Genetics Society of
America, 2013, pp. 527–40, doi:10.1534/genetics.113.153536.
short: H. Long, T. Paixao, R. Azevedo, R. Zufall, Genetics 195 (2013) 527–540.
date_created: 2018-12-11T11:59:15Z
date_published: 2013-10-01T00:00:00Z
date_updated: 2025-09-29T14:08:19Z
day: '01'
department:
- _id: NiBa
- _id: CaGu
doi: 10.1534/genetics.113.153536
ec_funded: 1
external_id:
isi:
- '000325286200020'
pmid:
- '23934880'
intvolume: ' 195'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3781978/
month: '10'
oa: 1
oa_version: Submitted Version
page: 527-540
pmid: 1
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: Genetics
publication_status: published
publisher: Genetics Society of America
publist_id: '4172'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Accumulation of spontaneous mutations in the ciliate Tetrahymena thermophila
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 195
year: '2013'
...