---
_id: '12632'
abstract:
- lang: eng
text: We investigate the performance of five glacier melt models over a multi-decadal
period in order to assess their ability to model future glacier response. The
models range from a simple degree-day model, based solely on air temperature,
to more-sophisticated models, including the full shortwave radiation balance.
In addition to the empirical models, the performance of a physically based energy-balance
(EB) model is examined. The melt models are coupled to an accumulation and a surface
evolution model and applied in a distributed manner to Rhonegletscher, Switzerland,
over the period 1929–2012 at hourly resolution. For calibration, seasonal mass-balance
measurements (2006–12) are used. Decadal ice volume changes for six periods in
the years 1929–2012 serve for model validation. Over the period 2006–12, there
are almost no differences in performance between the models, except for EB, which
is less consistent with observations, likely due to lack of meteorological in
situ data. However, simulations over the long term (1929–2012) reveal that models
which include a separate term for shortwave radiation agree best with the observed
ice volume changes, indicating that their melt relationships are robust in time
and thus suitable for long-term modelling, in contrast to more empirical approaches
that are oversensitive to temperature fluctuations.
article_processing_charge: No
article_type: original
author:
- first_name: Jeannette
full_name: Gabbi, Jeannette
last_name: Gabbi
- first_name: Marco
full_name: Carenzo, Marco
last_name: Carenzo
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
- first_name: Andreas
full_name: Bauder, Andreas
last_name: Bauder
- first_name: Martin
full_name: Funk, Martin
last_name: Funk
citation:
ama: Gabbi J, Carenzo M, Pellicciotti F, Bauder A, Funk M. A comparison of empirical
and physically based glacier surface melt models for long-term simulations of
glacier response. Journal of Glaciology. 2014;60(224):1140-1154. doi:10.3189/2014jog14j011
apa: Gabbi, J., Carenzo, M., Pellicciotti, F., Bauder, A., & Funk, M. (2014).
A comparison of empirical and physically based glacier surface melt models for
long-term simulations of glacier response. Journal of Glaciology. International
Glaciological Society. https://doi.org/10.3189/2014jog14j011
chicago: Gabbi, Jeannette, Marco Carenzo, Francesca Pellicciotti, Andreas Bauder,
and Martin Funk. “A Comparison of Empirical and Physically Based Glacier Surface
Melt Models for Long-Term Simulations of Glacier Response.” Journal of Glaciology.
International Glaciological Society, 2014. https://doi.org/10.3189/2014jog14j011.
ieee: J. Gabbi, M. Carenzo, F. Pellicciotti, A. Bauder, and M. Funk, “A comparison
of empirical and physically based glacier surface melt models for long-term simulations
of glacier response,” Journal of Glaciology, vol. 60, no. 224. International
Glaciological Society, pp. 1140–1154, 2014.
ista: Gabbi J, Carenzo M, Pellicciotti F, Bauder A, Funk M. 2014. A comparison of
empirical and physically based glacier surface melt models for long-term simulations
of glacier response. Journal of Glaciology. 60(224), 1140–1154.
mla: Gabbi, Jeannette, et al. “A Comparison of Empirical and Physically Based Glacier
Surface Melt Models for Long-Term Simulations of Glacier Response.” Journal
of Glaciology, vol. 60, no. 224, International Glaciological Society, 2014,
pp. 1140–54, doi:10.3189/2014jog14j011.
short: J. Gabbi, M. Carenzo, F. Pellicciotti, A. Bauder, M. Funk, Journal of Glaciology
60 (2014) 1140–1154.
date_created: 2023-02-20T08:16:34Z
date_published: 2014-08-01T00:00:00Z
date_updated: 2023-02-24T08:56:35Z
day: '01'
doi: 10.3189/2014jog14j011
extern: '1'
intvolume: ' 60'
issue: '224'
keyword:
- Earth-Surface Processes
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.3189/2014JoG14J011
month: '08'
oa: 1
oa_version: Published Version
page: 1140-1154
publication: Journal of Glaciology
publication_identifier:
eissn:
- 1727-5652
issn:
- 0022-1430
publication_status: published
publisher: International Glaciological Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: A comparison of empirical and physically based glacier surface melt models
for long-term simulations of glacier response
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 60
year: '2014'
...
---
_id: '12637'
abstract:
- lang: eng
text: The performance of glaciohydrological models which simulate catchment response
to climate variability depends to a large degree on the data used to force the
models. The forcing data become increasingly important in high-elevation, glacierized
catchments where the interplay between extreme topography, climate, and the cryosphere
is complex. It is challenging to generate a reliable forcing data set that captures
this spatial heterogeneity. In this paper, we analyze the results of a 1 year
field campaign focusing on air temperature and precipitation observations in the
Langtang valley in the Nepalese Himalayas. We use the observed time series to
characterize both temperature lapse rates (LRs) and precipitation gradients (PGs).
We study their spatial and temporal variability, and we attempt to identify possible
controlling factors. We show that very clear LRs exist in the valley and that
there are strong seasonal differences related to the water vapor content in the
atmosphere. Results also show that the LRs are generally shallower than the commonly
used environmental lapse rates. The analysis of the precipitation observations
reveals that there is great variability in precipitation over short horizontal
distances. A uniform valley wide PG cannot be established, and several scale-dependent
mechanisms may explain our observations. We complete our analysis by showing the
impact of the observed LRs and PGs on the outputs of the TOPKAPI-ETH glaciohydrological
model. We conclude that LRs and PGs have a very large impact on the water balance
composition and that short-term monitoring campaigns have the potential to improve
model quality considerably.
article_processing_charge: No
article_type: original
author:
- first_name: W. W.
full_name: Immerzeel, W. W.
last_name: Immerzeel
- first_name: L.
full_name: Petersen, L.
last_name: Petersen
- first_name: S.
full_name: Ragettli, S.
last_name: Ragettli
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
citation:
ama: Immerzeel WW, Petersen L, Ragettli S, Pellicciotti F. The importance of observed
gradients of air temperature and precipitation for modeling runoff from a glacierized
watershed in the Nepalese Himalayas. Water Resources Research. 2014;50(3):2212-2226.
doi:10.1002/2013wr014506
apa: Immerzeel, W. W., Petersen, L., Ragettli, S., & Pellicciotti, F. (2014).
The importance of observed gradients of air temperature and precipitation for
modeling runoff from a glacierized watershed in the Nepalese Himalayas. Water
Resources Research. American Geophysical Union. https://doi.org/10.1002/2013wr014506
chicago: Immerzeel, W. W., L. Petersen, S. Ragettli, and Francesca Pellicciotti.
“The Importance of Observed Gradients of Air Temperature and Precipitation for
Modeling Runoff from a Glacierized Watershed in the Nepalese Himalayas.” Water
Resources Research. American Geophysical Union, 2014. https://doi.org/10.1002/2013wr014506.
ieee: W. W. Immerzeel, L. Petersen, S. Ragettli, and F. Pellicciotti, “The importance
of observed gradients of air temperature and precipitation for modeling runoff
from a glacierized watershed in the Nepalese Himalayas,” Water Resources Research,
vol. 50, no. 3. American Geophysical Union, pp. 2212–2226, 2014.
ista: Immerzeel WW, Petersen L, Ragettli S, Pellicciotti F. 2014. The importance
of observed gradients of air temperature and precipitation for modeling runoff
from a glacierized watershed in the Nepalese Himalayas. Water Resources Research.
50(3), 2212–2226.
mla: Immerzeel, W. W., et al. “The Importance of Observed Gradients of Air Temperature
and Precipitation for Modeling Runoff from a Glacierized Watershed in the Nepalese
Himalayas.” Water Resources Research, vol. 50, no. 3, American Geophysical
Union, 2014, pp. 2212–26, doi:10.1002/2013wr014506.
short: W.W. Immerzeel, L. Petersen, S. Ragettli, F. Pellicciotti, Water Resources
Research 50 (2014) 2212–2226.
date_created: 2023-02-20T08:17:01Z
date_published: 2014-03-01T00:00:00Z
date_updated: 2023-02-24T08:28:23Z
day: '01'
doi: 10.1002/2013wr014506
extern: '1'
intvolume: ' 50'
issue: '3'
keyword:
- Water Science and Technology
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1002/2013WR014506
month: '03'
oa: 1
oa_version: Published Version
page: 2212-2226
publication: Water Resources Research
publication_identifier:
eissn:
- 1944-7973
issn:
- 0043-1397
publication_status: published
publisher: American Geophysical Union
quality_controlled: '1'
scopus_import: '1'
status: public
title: The importance of observed gradients of air temperature and precipitation for
modeling runoff from a glacierized watershed in the Nepalese Himalayas
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 50
year: '2014'
...
---
_id: '9050'
abstract:
- lang: eng
text: Self-propelled particles can exhibit surprising non-equilibrium behaviors,
and how they interact with obstacles or boundaries remains an important open problem.
Here we show that chemically propelled micro-rods can be captured, with little
change in their speed, into close orbits around solid spheres resting on or near
a horizontal plane. We show that this interaction between sphere and particle
is short-range, occurring even for spheres smaller than the particle length, and
for a variety of sphere materials. We consider a simple model, based on lubrication
theory, of a force- and torque-free swimmer driven by a surface slip (the phoretic
propulsion mechanism) and moving near a solid surface. The model demonstrates
capture, or movement towards the surface, and yields speeds independent of distance.
This study reveals the crucial aspects of activity–driven interactions of self-propelled
particles with passive objects, and brings into question the use of colloidal
tracers as probes of active matter.
article_number: '1784'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Daisuke
full_name: Takagi, Daisuke
last_name: Takagi
- first_name: Jérémie A
full_name: Palacci, Jérémie A
id: 8fb92548-2b22-11eb-b7c1-a3f0d08d7c7d
last_name: Palacci
orcid: 0000-0002-7253-9465
- first_name: Adam B.
full_name: Braunschweig, Adam B.
last_name: Braunschweig
- first_name: Michael J.
full_name: Shelley, Michael J.
last_name: Shelley
- first_name: Jun
full_name: Zhang, Jun
last_name: Zhang
citation:
ama: Takagi D, Palacci JA, Braunschweig AB, Shelley MJ, Zhang J. Hydrodynamic capture
of microswimmers into sphere-bound orbits. Soft Matter. 2014;10(11). doi:10.1039/c3sm52815d
apa: Takagi, D., Palacci, J. A., Braunschweig, A. B., Shelley, M. J., & Zhang,
J. (2014). Hydrodynamic capture of microswimmers into sphere-bound orbits. Soft
Matter. Royal Society of Chemistry . https://doi.org/10.1039/c3sm52815d
chicago: Takagi, Daisuke, Jérémie A Palacci, Adam B. Braunschweig, Michael J. Shelley,
and Jun Zhang. “Hydrodynamic Capture of Microswimmers into Sphere-Bound Orbits.”
Soft Matter. Royal Society of Chemistry , 2014. https://doi.org/10.1039/c3sm52815d.
ieee: D. Takagi, J. A. Palacci, A. B. Braunschweig, M. J. Shelley, and J. Zhang,
“Hydrodynamic capture of microswimmers into sphere-bound orbits,” Soft Matter,
vol. 10, no. 11. Royal Society of Chemistry , 2014.
ista: Takagi D, Palacci JA, Braunschweig AB, Shelley MJ, Zhang J. 2014. Hydrodynamic
capture of microswimmers into sphere-bound orbits. Soft Matter. 10(11), 1784.
mla: Takagi, Daisuke, et al. “Hydrodynamic Capture of Microswimmers into Sphere-Bound
Orbits.” Soft Matter, vol. 10, no. 11, 1784, Royal Society of Chemistry
, 2014, doi:10.1039/c3sm52815d.
short: D. Takagi, J.A. Palacci, A.B. Braunschweig, M.J. Shelley, J. Zhang, Soft
Matter 10 (2014).
date_created: 2021-02-01T13:43:31Z
date_published: 2014-03-21T00:00:00Z
date_updated: 2023-02-23T13:47:35Z
day: '21'
doi: 10.1039/c3sm52815d
extern: '1'
external_id:
arxiv:
- '1309.5662'
pmid:
- '24800268'
intvolume: ' 10'
issue: '11'
keyword:
- General Chemistry
- Condensed Matter Physics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1309.5662
month: '03'
oa: 1
oa_version: Preprint
pmid: 1
publication: Soft Matter
publication_identifier:
eissn:
- 1744-6848
issn:
- 1744-683X
publication_status: published
publisher: 'Royal Society of Chemistry '
quality_controlled: '1'
scopus_import: '1'
status: public
title: Hydrodynamic capture of microswimmers into sphere-bound orbits
type: journal_article
user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425
volume: 10
year: '2014'
...
---
_id: '9166'
abstract:
- lang: eng
text: Light-activated self-propelled colloids are synthesized and their active motion
is studied using optical microscopy. We propose a versatile route using different
photoactive materials, and demonstrate a multiwavelength activation and propulsion.
Thanks to the photoelectrochemical properties of two semiconductor materials (α-Fe2O3
and TiO2), a light with an energy higher than the bandgap triggers the reaction
of decomposition of hydrogen peroxide and produces a chemical cloud around the
particle. It induces a phoretic attraction with neighbouring colloids as well
as an osmotic self-propulsion of the particle on the substrate. We use these mechanisms
to form colloidal cargos as well as self-propelled particles where the light-activated
component is embedded into a dielectric sphere. The particles are self-propelled
along a direction otherwise randomized by thermal fluctuations, and exhibit a
persistent random walk. For sufficient surface density, the particles spontaneously
form ‘living crystals’ which are mobile, break apart and reform. Steering the
particle with an external magnetic field, we show that the formation of the dense
phase results from the collisions heads-on of the particles. This effect is intrinsically
non-equilibrium and a novel principle of organization for systems without detailed
balance. Engineering families of particles self-propelled by different wavelength
demonstrate a good understanding of both the physics and the chemistry behind
the system and points to a general route for designing new families of self-propelled
particles.
article_number: '20130372'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Jérémie A
full_name: Palacci, Jérémie A
id: 8fb92548-2b22-11eb-b7c1-a3f0d08d7c7d
last_name: Palacci
orcid: 0000-0002-7253-9465
- first_name: S.
full_name: Sacanna, S.
last_name: Sacanna
- first_name: S.-H.
full_name: Kim, S.-H.
last_name: Kim
- first_name: G.-R.
full_name: Yi, G.-R.
last_name: Yi
- first_name: D. J.
full_name: Pine, D. J.
last_name: Pine
- first_name: P. M.
full_name: Chaikin, P. M.
last_name: Chaikin
citation:
ama: 'Palacci JA, Sacanna S, Kim S-H, Yi G-R, Pine DJ, Chaikin PM. Light-activated
self-propelled colloids. Philosophical Transactions of the Royal Society A:
Mathematical, Physical and Engineering Sciences. 2014;372(2029). doi:10.1098/rsta.2013.0372'
apa: 'Palacci, J. A., Sacanna, S., Kim, S.-H., Yi, G.-R., Pine, D. J., & Chaikin,
P. M. (2014). Light-activated self-propelled colloids. Philosophical Transactions
of the Royal Society A: Mathematical, Physical and Engineering Sciences. The
Royal Society. https://doi.org/10.1098/rsta.2013.0372'
chicago: 'Palacci, Jérémie A, S. Sacanna, S.-H. Kim, G.-R. Yi, D. J. Pine, and P.
M. Chaikin. “Light-Activated Self-Propelled Colloids.” Philosophical Transactions
of the Royal Society A: Mathematical, Physical and Engineering Sciences. The
Royal Society, 2014. https://doi.org/10.1098/rsta.2013.0372.'
ieee: 'J. A. Palacci, S. Sacanna, S.-H. Kim, G.-R. Yi, D. J. Pine, and P. M. Chaikin,
“Light-activated self-propelled colloids,” Philosophical Transactions of the
Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 372,
no. 2029. The Royal Society, 2014.'
ista: 'Palacci JA, Sacanna S, Kim S-H, Yi G-R, Pine DJ, Chaikin PM. 2014. Light-activated
self-propelled colloids. Philosophical Transactions of the Royal Society A: Mathematical,
Physical and Engineering Sciences. 372(2029), 20130372.'
mla: 'Palacci, Jérémie A., et al. “Light-Activated Self-Propelled Colloids.” Philosophical
Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences,
vol. 372, no. 2029, 20130372, The Royal Society, 2014, doi:10.1098/rsta.2013.0372.'
short: 'J.A. Palacci, S. Sacanna, S.-H. Kim, G.-R. Yi, D.J. Pine, P.M. Chaikin,
Philosophical Transactions of the Royal Society A: Mathematical, Physical and
Engineering Sciences 372 (2014).'
date_created: 2021-02-18T14:31:11Z
date_published: 2014-11-28T00:00:00Z
date_updated: 2021-02-22T10:44:16Z
day: '28'
doi: 10.1098/rsta.2013.0372
extern: '1'
external_id:
arxiv:
- '1410.7278'
pmid:
- '25332383'
intvolume: ' 372'
issue: '2029'
keyword:
- General Engineering
- General Physics and Astronomy
- General Mathematics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1098/rsta.2013.0372
month: '11'
oa: 1
oa_version: Published Version
pmid: 1
publication: 'Philosophical Transactions of the Royal Society A: Mathematical, Physical
and Engineering Sciences'
publication_identifier:
eissn:
- 1471-2962
issn:
- 1364-503X
publication_status: published
publisher: The Royal Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Light-activated self-propelled colloids
type: journal_article
user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425
volume: 372
year: '2014'
...
---
_id: '7038'
article_processing_charge: No
author:
- first_name: Kristóf
full_name: Huszár, Kristóf
id: 33C26278-F248-11E8-B48F-1D18A9856A87
last_name: Huszár
orcid: 0000-0002-5445-5057
- first_name: Michal
full_name: Rolinek, Michal
id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
last_name: Rolinek
citation:
ama: Huszár K, Rolinek M. Playful Math - An Introduction to Mathematical Games.
IST Austria
apa: Huszár, K., & Rolinek, M. (n.d.). Playful Math - An introduction to
mathematical games. IST Austria.
chicago: Huszár, Kristóf, and Michal Rolinek. Playful Math - An Introduction
to Mathematical Games. IST Austria, n.d.
ieee: K. Huszár and M. Rolinek, Playful Math - An introduction to mathematical
games. IST Austria.
ista: Huszár K, Rolinek M. Playful Math - An introduction to mathematical games,
IST Austria, 5p.
mla: Huszár, Kristóf, and Michal Rolinek. Playful Math - An Introduction to Mathematical
Games. IST Austria.
short: K. Huszár, M. Rolinek, Playful Math - An Introduction to Mathematical Games,
IST Austria, n.d.
date_created: 2019-11-18T15:57:05Z
date_published: 2014-06-30T00:00:00Z
date_updated: 2020-07-14T23:11:45Z
day: '30'
ddc:
- '510'
department:
- _id: VlKo
- _id: UlWa
file:
- access_level: open_access
checksum: 2b94e5e1f4c3fe8ab89b12806276fb09
content_type: application/pdf
creator: dernst
date_created: 2019-11-18T15:57:51Z
date_updated: 2020-07-14T12:47:48Z
file_id: '7039'
file_name: 2014_Playful_Math_Huszar.pdf
file_size: 511233
relation: main_file
file_date_updated: 2020-07-14T12:47:48Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '5'
publication_status: draft
publisher: IST Austria
status: public
title: Playful Math - An introduction to mathematical games
type: working_paper
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '7071'
abstract:
- lang: eng
text: Spin and orbital quantum numbers play a key role in the physics of Mott insulators,
but in most systems they are connected only indirectly—via the Pauli exclusion
principle and the Coulomb interaction. Iridium-based oxides (iridates) introduce
strong spin–orbit coupling directly, such that these numbers become entwined together
and the Mott physics attains a strong orbital character. In the layered honeycomb
iridates this is thought to generate highly spin–anisotropic magnetic interactions,
coupling the spin to a given spatial direction of exchange and leading to strongly
frustrated magnetism. Here we report a new iridate structure that has the same
local connectivity as the layered honeycomb and exhibits striking evidence for
highly spin–anisotropic exchange. The basic structural units of this material
suggest that a new family of three-dimensional structures could exist, the ‘harmonic
honeycomb’ iridates, of which the present compound is the first example.
article_number: '4203'
article_processing_charge: No
article_type: original
author:
- first_name: Kimberly A
full_name: Modic, Kimberly A
id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425
last_name: Modic
orcid: 0000-0001-9760-3147
- first_name: Tess E.
full_name: Smidt, Tess E.
last_name: Smidt
- first_name: Itamar
full_name: Kimchi, Itamar
last_name: Kimchi
- first_name: Nicholas P.
full_name: Breznay, Nicholas P.
last_name: Breznay
- first_name: Alun
full_name: Biffin, Alun
last_name: Biffin
- first_name: Sungkyun
full_name: Choi, Sungkyun
last_name: Choi
- first_name: Roger D.
full_name: Johnson, Roger D.
last_name: Johnson
- first_name: Radu
full_name: Coldea, Radu
last_name: Coldea
- first_name: Pilanda
full_name: Watkins-Curry, Pilanda
last_name: Watkins-Curry
- first_name: Gregory T.
full_name: McCandless, Gregory T.
last_name: McCandless
- first_name: Julia Y.
full_name: Chan, Julia Y.
last_name: Chan
- first_name: Felipe
full_name: Gandara, Felipe
last_name: Gandara
- first_name: Z.
full_name: Islam, Z.
last_name: Islam
- first_name: Ashvin
full_name: Vishwanath, Ashvin
last_name: Vishwanath
- first_name: Arkady
full_name: Shekhter, Arkady
last_name: Shekhter
- first_name: Ross D.
full_name: McDonald, Ross D.
last_name: McDonald
- first_name: James G.
full_name: Analytis, James G.
last_name: Analytis
citation:
ama: Modic KA, Smidt TE, Kimchi I, et al. Realization of a three-dimensional spin–anisotropic
harmonic honeycomb iridate. Nature Communications. 2014;5. doi:10.1038/ncomms5203
apa: Modic, K. A., Smidt, T. E., Kimchi, I., Breznay, N. P., Biffin, A., Choi, S.,
… Analytis, J. G. (2014). Realization of a three-dimensional spin–anisotropic
harmonic honeycomb iridate. Nature Communications. Springer Science and
Business Media LLC. https://doi.org/10.1038/ncomms5203
chicago: Modic, Kimberly A, Tess E. Smidt, Itamar Kimchi, Nicholas P. Breznay, Alun
Biffin, Sungkyun Choi, Roger D. Johnson, et al. “Realization of a Three-Dimensional
Spin–Anisotropic Harmonic Honeycomb Iridate.” Nature Communications. Springer
Science and Business Media LLC, 2014. https://doi.org/10.1038/ncomms5203.
ieee: K. A. Modic et al., “Realization of a three-dimensional spin–anisotropic
harmonic honeycomb iridate,” Nature Communications, vol. 5. Springer Science
and Business Media LLC, 2014.
ista: Modic KA, Smidt TE, Kimchi I, Breznay NP, Biffin A, Choi S, Johnson RD, Coldea
R, Watkins-Curry P, McCandless GT, Chan JY, Gandara F, Islam Z, Vishwanath A,
Shekhter A, McDonald RD, Analytis JG. 2014. Realization of a three-dimensional
spin–anisotropic harmonic honeycomb iridate. Nature Communications. 5, 4203.
mla: Modic, Kimberly A., et al. “Realization of a Three-Dimensional Spin–Anisotropic
Harmonic Honeycomb Iridate.” Nature Communications, vol. 5, 4203, Springer
Science and Business Media LLC, 2014, doi:10.1038/ncomms5203.
short: K.A. Modic, T.E. Smidt, I. Kimchi, N.P. Breznay, A. Biffin, S. Choi, R.D.
Johnson, R. Coldea, P. Watkins-Curry, G.T. McCandless, J.Y. Chan, F. Gandara,
Z. Islam, A. Vishwanath, A. Shekhter, R.D. McDonald, J.G. Analytis, Nature Communications
5 (2014).
date_created: 2019-11-19T13:22:39Z
date_published: 2014-06-27T00:00:00Z
date_updated: 2021-01-12T08:11:42Z
day: '27'
ddc:
- '530'
doi: 10.1038/ncomms5203
extern: '1'
file:
- access_level: open_access
checksum: d290f0bfa93c5169cc6c8086874c5a78
content_type: application/pdf
creator: dernst
date_created: 2019-11-26T12:44:23Z
date_updated: 2020-07-14T12:47:48Z
file_id: '7113'
file_name: 2014_NatureComm_Modic.pdf
file_size: 4832820
relation: main_file
file_date_updated: 2020-07-14T12:47:48Z
has_accepted_license: '1'
intvolume: ' 5'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '06'
oa: 1
oa_version: Published Version
publication: Nature Communications
publication_identifier:
issn:
- 2041-1723
publication_status: published
publisher: Springer Science and Business Media LLC
quality_controlled: '1'
status: public
title: Realization of a three-dimensional spin–anisotropic harmonic honeycomb iridate
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2014'
...
---
_id: '7598'
article_processing_charge: No
article_type: original
author:
- first_name: Shutang
full_name: Tan, Shutang
id: 2DE75584-F248-11E8-B48F-1D18A9856A87
last_name: Tan
orcid: 0000-0002-0471-8285
- first_name: Hong-Wei
full_name: Xue, Hong-Wei
last_name: Xue
citation:
ama: Tan S, Xue H-W. Casein kinase 1 regulates ethylene synthesis by phosphorylating
and promoting the turnover of ACS5. Cell Reports. 2014;9(5):1692-1702.
doi:10.1016/j.celrep.2014.10.047
apa: Tan, S., & Xue, H.-W. (2014). Casein kinase 1 regulates ethylene synthesis
by phosphorylating and promoting the turnover of ACS5. Cell Reports. Elsevier.
https://doi.org/10.1016/j.celrep.2014.10.047
chicago: Tan, Shutang, and Hong-Wei Xue. “Casein Kinase 1 Regulates Ethylene Synthesis
by Phosphorylating and Promoting the Turnover of ACS5.” Cell Reports. Elsevier,
2014. https://doi.org/10.1016/j.celrep.2014.10.047.
ieee: S. Tan and H.-W. Xue, “Casein kinase 1 regulates ethylene synthesis by phosphorylating
and promoting the turnover of ACS5,” Cell Reports, vol. 9, no. 5. Elsevier,
pp. 1692–1702, 2014.
ista: Tan S, Xue H-W. 2014. Casein kinase 1 regulates ethylene synthesis by phosphorylating
and promoting the turnover of ACS5. Cell Reports. 9(5), 1692–1702.
mla: Tan, Shutang, and Hong-Wei Xue. “Casein Kinase 1 Regulates Ethylene Synthesis
by Phosphorylating and Promoting the Turnover of ACS5.” Cell Reports, vol.
9, no. 5, Elsevier, 2014, pp. 1692–702, doi:10.1016/j.celrep.2014.10.047.
short: S. Tan, H.-W. Xue, Cell Reports 9 (2014) 1692–1702.
date_created: 2020-03-21T16:08:18Z
date_published: 2014-12-11T00:00:00Z
date_updated: 2021-01-12T08:14:24Z
day: '11'
ddc:
- '580'
doi: 10.1016/j.celrep.2014.10.047
extern: '1'
file:
- access_level: open_access
checksum: 23c30de4ac98ce9879fc054121517626
content_type: application/pdf
creator: dernst
date_created: 2020-03-23T12:23:40Z
date_updated: 2020-07-14T12:48:01Z
file_id: '7613'
file_name: 2014_CellPress_Tan.pdf
file_size: 2755808
relation: main_file
file_date_updated: 2020-07-14T12:48:01Z
has_accepted_license: '1'
intvolume: ' 9'
issue: '5'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '12'
oa: 1
oa_version: Published Version
page: 1692-1702
publication: Cell Reports
publication_identifier:
issn:
- 2211-1247
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: Casein kinase 1 regulates ethylene synthesis by phosphorylating and promoting
the turnover of ACS5
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: '772'
abstract:
- lang: eng
text: Lock-free concurrent algorithms guarantee that some concurrent operation will
always make progress in a finite number of steps. Yet programmers prefer to treat
concurrent code as if it were wait-free, guaranteeing that all operations always
make progress. Unfortunately, designing wait-free algorithms is generally a very
complex task, and the resulting algorithms are not always efficient. While obtaining
efficient wait-free algorithms has been a long-time goal for the theory community,
most non-blocking commercial code is only lock-free. This paper suggests a simple
solution to this problem. We show that, for a large class of lock-free algorithms,
under scheduling conditions which approximate those found in commercial hardware
architectures, lock-free algorithms behave as if they are wait-free. In other
words, programmers can keep on designing simple lock-free algorithms instead of
complex wait-free ones, and in practice, they will get wait-free progress. Our
main contribution is a new way of analyzing a general class of lock-free algorithms
under a stochastic scheduler. Our analysis relates the individual performance
of processes with the global performance of the system using Markov chain lifting
between a complex per-process chain and a simpler system progress chain. We show
that lock-free algorithms are not only wait-free with probability 1, but that
in fact a general subset of lock-free algorithms can be closely bounded in terms
of the average number of steps required until an operation completes. To the best
of our knowledge, this is the first attempt to analyze progress conditions, typically
stated in relation to a worst case adversary, in a stochastic model capturing
their expected asymptotic behavior.
acknowledgement: "Dan Alistarh - Part of this work was performed while the author
was a Postdoctoral Associate at MIT CSAIL, where he was supported by SNF\r\nPostdoctoral
Fellows Program, NSF grant CCF-1217921, DoE\r\nASCR grant ER26116/DE-SC0008923,
and by grants from the Oracle and Intel corporations.\r\nKeron Censor-Hillel - Shalon
Fellow\r\nNir Shavit - This work was supported in part by NSF grants CCF-1217921
and\r\nCCF-1301926, DoE ASCR grant ER26116/DE-SC0008923, and\r\nby grants from the
Oracle and Intel corporations."
article_processing_charge: No
arxiv: 1
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Keren
full_name: Censor Hillel, Keren
last_name: Censor Hillel
- first_name: Nir
full_name: Shavit, Nir
last_name: Shavit
citation:
ama: 'Alistarh D-A, Censor Hillel K, Shavit N. Are lock-free concurrent algorithms
practically wait-free? In: ACM; 2014:714-723. doi:10.1145/2591796.2591836'
apa: 'Alistarh, D.-A., Censor Hillel, K., & Shavit, N. (2014). Are lock-free
concurrent algorithms practically wait-free? (pp. 714–723). Presented at the STOC:
Symposium on Theory of Computing, ACM. https://doi.org/10.1145/2591796.2591836'
chicago: Alistarh, Dan-Adrian, Keren Censor Hillel, and Nir Shavit. “Are Lock-Free
Concurrent Algorithms Practically Wait-Free?,” 714–23. ACM, 2014. https://doi.org/10.1145/2591796.2591836.
ieee: 'D.-A. Alistarh, K. Censor Hillel, and N. Shavit, “Are lock-free concurrent
algorithms practically wait-free?,” presented at the STOC: Symposium on Theory
of Computing, 2014, pp. 714–723.'
ista: 'Alistarh D-A, Censor Hillel K, Shavit N. 2014. Are lock-free concurrent algorithms
practically wait-free? STOC: Symposium on Theory of Computing, 714–723.'
mla: Alistarh, Dan-Adrian, et al. Are Lock-Free Concurrent Algorithms Practically
Wait-Free? ACM, 2014, pp. 714–23, doi:10.1145/2591796.2591836.
short: D.-A. Alistarh, K. Censor Hillel, N. Shavit, in:, ACM, 2014, pp. 714–723.
conference:
name: 'STOC: Symposium on Theory of Computing'
date_created: 2018-12-11T11:48:25Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2023-02-23T13:15:13Z
day: '01'
doi: 10.1145/2591796.2591836
extern: '1'
external_id:
arxiv:
- '1311.3200'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1311.3200
month: '01'
oa: 1
oa_version: Preprint
page: 714 - 723
publication_status: published
publisher: ACM
publist_id: '6885'
status: public
title: Are lock-free concurrent algorithms practically wait-free?
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '775'
abstract:
- lang: eng
text: 'The long-lived renaming problem appears in shared-memory systems where a
set of threads need to register and deregister frequently from the computation,
while concurrent operations scan the set of currently registered threads. Instances
of this problem show up in concurrent implementations of transactional memory,
flat combining, thread barriers, and memory reclamation schemes for lock-free
data structures. In this paper, we analyze a randomized solution for long-lived
renaming. The algorithmic technique we consider, called the Level Array, has previously
been used for hashing and one-shot (single-use) renaming. Our main contribution
is to prove that, in long-lived executions, where processes may register and deregister
polynomially many times, the technique guarantees constant steps on average and
O (log log n) steps with high probability for registering, unit cost for deregistering,
and O (n) steps for collect queries, where n is an upper bound on the number of
processes that may be active at any point in time. We also show that the algorithm
has the surprising property that it is self-healing: under reasonable assumptions
on the schedule, operations running while the data structure is in a degraded
state implicitly help the data structure re-balance itself. This subtle mechanism
obviates the need for expensive periodic rebuilding procedures. Our benchmarks
validate this approach, showing that, for typical use parameters, the average
number of steps a process takes to register is less than two and the worst-case
number of steps is bounded by six, even in executions with billions of operations.
We contrast this with other randomized implementations, whose worst-case behavior
we show to be unreliable, and with deterministic implementations, whose cost is
linear in n.'
article_processing_charge: No
arxiv: 1
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Justin
full_name: Kopinsky, Justin
last_name: Kopinsky
- first_name: Alexander
full_name: Matveev, Alexander
last_name: Matveev
- first_name: Nir
full_name: Shavit, Nir
last_name: Shavit
citation:
ama: 'Alistarh D-A, Kopinsky J, Matveev A, Shavit N. The levelarray: A fast, practical
long-lived renaming algorithm. In: IEEE; 2014:348-357. doi:10.1109/ICDCS.2014.43'
apa: 'Alistarh, D.-A., Kopinsky, J., Matveev, A., & Shavit, N. (2014). The levelarray:
A fast, practical long-lived renaming algorithm (pp. 348–357). Presented at the
ICDCS: International Conference on Distributed Computing Systems, IEEE. https://doi.org/10.1109/ICDCS.2014.43'
chicago: 'Alistarh, Dan-Adrian, Justin Kopinsky, Alexander Matveev, and Nir Shavit.
“The Levelarray: A Fast, Practical Long-Lived Renaming Algorithm,” 348–57. IEEE,
2014. https://doi.org/10.1109/ICDCS.2014.43.'
ieee: 'D.-A. Alistarh, J. Kopinsky, A. Matveev, and N. Shavit, “The levelarray:
A fast, practical long-lived renaming algorithm,” presented at the ICDCS: International
Conference on Distributed Computing Systems, 2014, pp. 348–357.'
ista: 'Alistarh D-A, Kopinsky J, Matveev A, Shavit N. 2014. The levelarray: A fast,
practical long-lived renaming algorithm. ICDCS: International Conference on Distributed
Computing Systems, 348–357.'
mla: 'Alistarh, Dan-Adrian, et al. The Levelarray: A Fast, Practical Long-Lived
Renaming Algorithm. IEEE, 2014, pp. 348–57, doi:10.1109/ICDCS.2014.43.'
short: D.-A. Alistarh, J. Kopinsky, A. Matveev, N. Shavit, in:, IEEE, 2014, pp.
348–357.
conference:
name: 'ICDCS: International Conference on Distributed Computing Systems'
date_created: 2018-12-11T11:48:26Z
date_published: 2014-08-29T00:00:00Z
date_updated: 2023-02-23T13:16:18Z
day: '29'
doi: 10.1109/ICDCS.2014.43
extern: '1'
external_id:
arxiv:
- '1405.5461'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1405.5461
month: '08'
oa: 1
oa_version: Preprint
page: 348 - 357
publication_status: published
publisher: IEEE
publist_id: '6883'
status: public
title: 'The levelarray: A fast, practical long-lived renaming algorithm'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '7771'
abstract:
- lang: eng
text: 'In their Letter, Schreck, Bertrand, O''Hern and Shattuck [Phys. Rev. Lett.
107, 078301 (2011)] study nonlinearities in jammed particulate systems that arise
when contacts are altered. They conclude that there is "no harmonic regime in
the large system limit for all compressions" and "at jamming onset for any system
size." Their argument rests on the claim that for finite-range repulsive potentials,
of the form used in studies of jamming, the breaking or forming of a single contact
is sufficient to destroy the linear regime. We dispute these conclusions and argue
that linear response is both justified and essential for understanding the nature
of the jammed solid. '
article_number: '049801 '
article_processing_charge: No
article_type: letter_note
arxiv: 1
author:
- first_name: Carl Peter
full_name: Goodrich, Carl Peter
id: EB352CD2-F68A-11E9-89C5-A432E6697425
last_name: Goodrich
orcid: 0000-0002-1307-5074
- first_name: Andrea J.
full_name: Liu, Andrea J.
last_name: Liu
- first_name: Sidney R.
full_name: Nagel, Sidney R.
last_name: Nagel
citation:
ama: Goodrich CP, Liu AJ, Nagel SR. Comment on “Repulsive contact interactions make
jammed particulate systems inherently nonharmonic.” Physical Review Letters.
2014;112(4). doi:10.1103/physrevlett.112.049801
apa: Goodrich, C. P., Liu, A. J., & Nagel, S. R. (2014). Comment on “Repulsive
contact interactions make jammed particulate systems inherently nonharmonic.”
Physical Review Letters. American Physical Society. https://doi.org/10.1103/physrevlett.112.049801
chicago: Goodrich, Carl Peter, Andrea J. Liu, and Sidney R. Nagel. “Comment on ‘Repulsive
Contact Interactions Make Jammed Particulate Systems Inherently Nonharmonic.’”
Physical Review Letters. American Physical Society, 2014. https://doi.org/10.1103/physrevlett.112.049801.
ieee: C. P. Goodrich, A. J. Liu, and S. R. Nagel, “Comment on ‘Repulsive contact
interactions make jammed particulate systems inherently nonharmonic,’” Physical
Review Letters, vol. 112, no. 4. American Physical Society, 2014.
ista: Goodrich CP, Liu AJ, Nagel SR. 2014. Comment on “Repulsive contact interactions
make jammed particulate systems inherently nonharmonic”. Physical Review Letters.
112(4), 049801.
mla: Goodrich, Carl Peter, et al. “Comment on ‘Repulsive Contact Interactions Make
Jammed Particulate Systems Inherently Nonharmonic.’” Physical Review Letters,
vol. 112, no. 4, 049801, American Physical Society, 2014, doi:10.1103/physrevlett.112.049801.
short: C.P. Goodrich, A.J. Liu, S.R. Nagel, Physical Review Letters 112 (2014).
date_created: 2020-04-30T11:42:39Z
date_published: 2014-04-20T00:00:00Z
date_updated: 2021-01-12T08:15:26Z
day: '20'
doi: 10.1103/physrevlett.112.049801
extern: '1'
external_id:
arxiv:
- '1306.1285'
intvolume: ' 112'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1306.1285
month: '04'
oa: 1
oa_version: Preprint
publication: Physical Review Letters
publication_identifier:
issn:
- 0031-9007
- 1079-7114
publication_status: published
publisher: American Physical Society
status: public
title: Comment on “Repulsive contact interactions make jammed particulate systems
inherently nonharmonic”
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 112
year: '2014'
...
---
_id: '8021'
abstract:
- lang: eng
text: 'Most excitatory inputs in the mammalian brain are made on dendritic spines,
rather than on dendritic shafts. Spines compartmentalize calcium, and this biochemical
isolation can underlie input-specific synaptic plasticity, providing a raison
d''etre for spines. However, recent results indicate that the spine can experience
a membrane potential different from that in the parent dendrite, as though the
spine neck electrically isolated the spine. Here we use two-photon calcium imaging
of mouse neocortical pyramidal neurons to analyze the correlation between the
morphologies of spines activated under minimal synaptic stimulation and the excitatory
postsynaptic potentials they generate. We find that excitatory postsynaptic potential
amplitudes are inversely correlated with spine neck lengths. Furthermore, a spike
timing-dependent plasticity protocol, in which two-photon glutamate uncaging over
a spine is paired with postsynaptic spikes, produces rapid shrinkage of the spine
neck and concomitant increases in the amplitude of the evoked spine potentials.
Using numerical simulations, we explore the parameter regimes for the spine neck
resistance and synaptic conductance changes necessary to explain our observations.
Our data, directly correlating synaptic and morphological plasticity, imply that
long-necked spines have small or negligible somatic voltage contributions, but
that, upon synaptic stimulation paired with postsynaptic activity, they can shorten
their necks and increase synaptic efficacy, thus changing the input/output gain
of pyramidal neurons. '
article_processing_charge: No
article_type: original
author:
- first_name: R.
full_name: Araya, R.
last_name: Araya
- first_name: Tim P
full_name: Vogels, Tim P
id: CB6FF8D2-008F-11EA-8E08-2637E6697425
last_name: Vogels
orcid: 0000-0003-3295-6181
- first_name: R.
full_name: Yuste, R.
last_name: Yuste
citation:
ama: Araya R, Vogels TP, Yuste R. Activity-dependent dendritic spine neck changes
are correlated with synaptic strength. Proceedings of the National Academy
of Sciences. 2014;111(28):E2895-E2904. doi:10.1073/pnas.1321869111
apa: Araya, R., Vogels, T. P., & Yuste, R. (2014). Activity-dependent dendritic
spine neck changes are correlated with synaptic strength. Proceedings of the
National Academy of Sciences. Proceedings of the National Academy of Sciences.
https://doi.org/10.1073/pnas.1321869111
chicago: Araya, R., Tim P Vogels, and R. Yuste. “Activity-Dependent Dendritic Spine
Neck Changes Are Correlated with Synaptic Strength.” Proceedings of the National
Academy of Sciences. Proceedings of the National Academy of Sciences, 2014.
https://doi.org/10.1073/pnas.1321869111.
ieee: R. Araya, T. P. Vogels, and R. Yuste, “Activity-dependent dendritic spine
neck changes are correlated with synaptic strength,” Proceedings of the National
Academy of Sciences, vol. 111, no. 28. Proceedings of the National Academy
of Sciences, pp. E2895–E2904, 2014.
ista: Araya R, Vogels TP, Yuste R. 2014. Activity-dependent dendritic spine neck
changes are correlated with synaptic strength. Proceedings of the National Academy
of Sciences. 111(28), E2895–E2904.
mla: Araya, R., et al. “Activity-Dependent Dendritic Spine Neck Changes Are Correlated
with Synaptic Strength.” Proceedings of the National Academy of Sciences,
vol. 111, no. 28, Proceedings of the National Academy of Sciences, 2014, pp. E2895–904,
doi:10.1073/pnas.1321869111.
short: R. Araya, T.P. Vogels, R. Yuste, Proceedings of the National Academy of Sciences
111 (2014) E2895–E2904.
date_created: 2020-06-25T13:06:24Z
date_published: 2014-07-15T00:00:00Z
date_updated: 2021-01-12T08:16:34Z
day: '15'
doi: 10.1073/pnas.1321869111
extern: '1'
external_id:
pmid:
- '24982196'
intvolume: ' 111'
issue: '28'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4104910/
month: '07'
oa: 1
oa_version: Published Version
page: E2895-E2904
pmid: 1
publication: Proceedings of the National Academy of Sciences
publication_identifier:
eissn:
- 1091-6490
issn:
- 0027-8424
publication_status: published
publisher: Proceedings of the National Academy of Sciences
quality_controlled: '1'
status: public
title: Activity-dependent dendritic spine neck changes are correlated with synaptic
strength
type: journal_article
user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425
volume: 111
year: '2014'
...
---
_id: '8022'
abstract:
- lang: eng
text: Populations of neurons in motor cortex engage in complex transient dynamics
of large amplitude during the execution of limb movements. Traditional network
models with stochastically assigned synapses cannot reproduce this behavior. Here
we introduce a class of cortical architectures with strong and random excitatory
recurrence that is stabilized by intricate, fine-tuned inhibition, optimized from
a control theory perspective. Such networks transiently amplify specific activity
states and can be used to reliably execute multidimensional movement patterns.
Similar to the experimental observations, these transients must be preceded by
a steady-state initialization phase from which the network relaxes back into the
background state by way of complex internal dynamics. In our networks, excitation
and inhibition are as tightly balanced as recently reported in experiments across
several brain areas, suggesting inhibitory control of complex excitatory recurrence
as a generic organizational principle in cortex.
article_processing_charge: No
article_type: original
author:
- first_name: Guillaume
full_name: Hennequin, Guillaume
last_name: Hennequin
- first_name: Tim P
full_name: Vogels, Tim P
id: CB6FF8D2-008F-11EA-8E08-2637E6697425
last_name: Vogels
orcid: 0000-0003-3295-6181
- first_name: Wulfram
full_name: Gerstner, Wulfram
last_name: Gerstner
citation:
ama: Hennequin G, Vogels TP, Gerstner W. Optimal control of transient dynamics in
balanced networks supports generation of complex movements. Neuron. 2014;82(6):1394-1406.
doi:10.1016/j.neuron.2014.04.045
apa: Hennequin, G., Vogels, T. P., & Gerstner, W. (2014). Optimal control of
transient dynamics in balanced networks supports generation of complex movements.
Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2014.04.045
chicago: Hennequin, Guillaume, Tim P Vogels, and Wulfram Gerstner. “Optimal Control
of Transient Dynamics in Balanced Networks Supports Generation of Complex Movements.”
Neuron. Elsevier, 2014. https://doi.org/10.1016/j.neuron.2014.04.045.
ieee: G. Hennequin, T. P. Vogels, and W. Gerstner, “Optimal control of transient
dynamics in balanced networks supports generation of complex movements,” Neuron,
vol. 82, no. 6. Elsevier, pp. 1394–1406, 2014.
ista: Hennequin G, Vogels TP, Gerstner W. 2014. Optimal control of transient dynamics
in balanced networks supports generation of complex movements. Neuron. 82(6),
1394–1406.
mla: Hennequin, Guillaume, et al. “Optimal Control of Transient Dynamics in Balanced
Networks Supports Generation of Complex Movements.” Neuron, vol. 82, no.
6, Elsevier, 2014, pp. 1394–406, doi:10.1016/j.neuron.2014.04.045.
short: G. Hennequin, T.P. Vogels, W. Gerstner, Neuron 82 (2014) 1394–1406.
date_created: 2020-06-25T13:07:37Z
date_published: 2014-06-18T00:00:00Z
date_updated: 2021-01-12T08:16:35Z
day: '18'
doi: 10.1016/j.neuron.2014.04.045
extern: '1'
external_id:
pmid:
- '24945778'
intvolume: ' 82'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6364799/
month: '06'
oa: 1
oa_version: Submitted Version
page: 1394-1406
pmid: 1
publication: Neuron
publication_identifier:
issn:
- 0896-6273
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: Optimal control of transient dynamics in balanced networks supports generation
of complex movements
type: journal_article
user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425
volume: 82
year: '2014'
...
---
_id: '8023'
abstract:
- lang: eng
text: Uniform random sparse network architectures are ubiquitous in computational
neuroscience, but the implicit hypothesis that they are a good representation
of real neuronal networks has been met with skepticism. Here we used two experimental
data sets, a study of triplet connectivity statistics and a data set measuring
neuronal responses to channelrhodopsin stimuli, to evaluate the fidelity of thousands
of model networks. Network architectures comprised three neuron types (excitatory,
fast spiking, and nonfast spiking inhibitory) and were created from a set of rules
that govern the statistics of the resulting connection types. In a high-dimensional
parameter scan, we varied the degree distributions (i.e., how many cells each
neuron connects with) and the synaptic weight correlations of synapses from or
onto the same neuron. These variations converted initially uniform random and
homogeneously connected networks, in which every neuron sent and received equal
numbers of synapses with equal synaptic strength distributions, to highly heterogeneous
networks in which the number of synapses per neuron, as well as average synaptic
strength of synapses from or to a neuron were variable. By evaluating the impact
of each variable on the network structure and dynamics, and their similarity to
the experimental data, we could falsify the uniform random sparse connectivity
hypothesis for 7 of 36 connectivity parameters, but we also confirmed the hypothesis
in 8 cases. Twenty-one parameters had no substantial impact on the results of
the test protocols we used.
article_processing_charge: No
article_type: original
author:
- first_name: Christian
full_name: Tomm, Christian
last_name: Tomm
- first_name: Michael
full_name: Avermann, Michael
last_name: Avermann
- first_name: Carl
full_name: Petersen, Carl
last_name: Petersen
- first_name: Wulfram
full_name: Gerstner, Wulfram
last_name: Gerstner
- first_name: Tim P
full_name: Vogels, Tim P
id: CB6FF8D2-008F-11EA-8E08-2637E6697425
last_name: Vogels
orcid: 0000-0003-3295-6181
citation:
ama: Tomm C, Avermann M, Petersen C, Gerstner W, Vogels TP. Connection-type-specific
biases make uniform random network models consistent with cortical recordings.
Journal of Neurophysiology. 2014;112(8):1801-1814. doi:10.1152/jn.00629.2013
apa: Tomm, C., Avermann, M., Petersen, C., Gerstner, W., & Vogels, T. P. (2014).
Connection-type-specific biases make uniform random network models consistent
with cortical recordings. Journal of Neurophysiology. American Physiological
Society. https://doi.org/10.1152/jn.00629.2013
chicago: Tomm, Christian, Michael Avermann, Carl Petersen, Wulfram Gerstner, and
Tim P Vogels. “Connection-Type-Specific Biases Make Uniform Random Network Models
Consistent with Cortical Recordings.” Journal of Neurophysiology. American
Physiological Society, 2014. https://doi.org/10.1152/jn.00629.2013.
ieee: C. Tomm, M. Avermann, C. Petersen, W. Gerstner, and T. P. Vogels, “Connection-type-specific
biases make uniform random network models consistent with cortical recordings,”
Journal of Neurophysiology, vol. 112, no. 8. American Physiological Society,
pp. 1801–1814, 2014.
ista: Tomm C, Avermann M, Petersen C, Gerstner W, Vogels TP. 2014. Connection-type-specific
biases make uniform random network models consistent with cortical recordings.
Journal of Neurophysiology. 112(8), 1801–1814.
mla: Tomm, Christian, et al. “Connection-Type-Specific Biases Make Uniform Random
Network Models Consistent with Cortical Recordings.” Journal of Neurophysiology,
vol. 112, no. 8, American Physiological Society, 2014, pp. 1801–14, doi:10.1152/jn.00629.2013.
short: C. Tomm, M. Avermann, C. Petersen, W. Gerstner, T.P. Vogels, Journal of Neurophysiology
112 (2014) 1801–1814.
date_created: 2020-06-25T13:08:30Z
date_published: 2014-10-15T00:00:00Z
date_updated: 2021-01-12T08:16:35Z
day: '15'
ddc:
- '570'
doi: 10.1152/jn.00629.2013
extern: '1'
external_id:
pmid:
- '24944218'
file:
- access_level: open_access
checksum: 7c06a086da6f924342650de6dc555c3f
content_type: application/pdf
creator: cziletti
date_created: 2020-07-16T10:12:13Z
date_updated: 2020-07-16T10:12:13Z
file_id: '8122'
file_name: 2014_JNeurophysiol_Tomm.pdf
file_size: 1632295
relation: main_file
success: 1
file_date_updated: 2020-07-16T10:12:13Z
has_accepted_license: '1'
intvolume: ' 112'
issue: '8'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/3.0/
month: '10'
oa: 1
oa_version: Published Version
page: 1801-1814
pmid: 1
publication: Journal of Neurophysiology
publication_identifier:
eissn:
- 1522-1598
issn:
- 0022-3077
publication_status: published
publisher: American Physiological Society
quality_controlled: '1'
status: public
title: Connection-type-specific biases make uniform random network models consistent
with cortical recordings
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: journal_article
user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425
volume: 112
year: '2014'
...
---
_id: '8044'
abstract:
- lang: eng
text: Many questions concerning models in quantum mechanics require a detailed analysis
of the spectrum of the corresponding Hamiltonian, a linear operator on a suitable
Hilbert space. Of particular relevance for an understanding of the low-temperature
properties of a system is the structure of the excitation spectrum, which is the
part of the spectrum close to the spectral bottom. We present recent progress
on this question for bosonic many-body quantum systems with weak two-body interactions.
Such system are currently of great interest, due to their experimental realization
in ultra-cold atomic gases. We investigate the accuracy of the Bogoliubov approximations,
which predicts that the low-energy spectrum is made up of sums of elementary excitations,
with linear dispersion law at low momentum. The latter property is crucial for
the superfluid behavior the system.
article_processing_charge: No
author:
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: 'Seiringer R. Structure of the excitation spectrum for many-body quantum systems.
In: Proceeding of the International Congress of Mathematicans. Vol 3. International
Congress of Mathematicians; 2014:1175-1194.'
apa: 'Seiringer, R. (2014). Structure of the excitation spectrum for many-body quantum
systems. In Proceeding of the International Congress of Mathematicans (Vol.
3, pp. 1175–1194). Seoul, South Korea: International Congress of Mathematicians.'
chicago: Seiringer, Robert. “Structure of the Excitation Spectrum for Many-Body
Quantum Systems.” In Proceeding of the International Congress of Mathematicans,
3:1175–94. International Congress of Mathematicians, 2014.
ieee: R. Seiringer, “Structure of the excitation spectrum for many-body quantum
systems,” in Proceeding of the International Congress of Mathematicans,
Seoul, South Korea, 2014, vol. 3, pp. 1175–1194.
ista: 'Seiringer R. 2014. Structure of the excitation spectrum for many-body quantum
systems. Proceeding of the International Congress of Mathematicans. ICM: International
Congress of Mathematicans vol. 3, 1175–1194.'
mla: Seiringer, Robert. “Structure of the Excitation Spectrum for Many-Body Quantum
Systems.” Proceeding of the International Congress of Mathematicans, vol.
3, International Congress of Mathematicians, 2014, pp. 1175–94.
short: R. Seiringer, in:, Proceeding of the International Congress of Mathematicans,
International Congress of Mathematicians, 2014, pp. 1175–1194.
conference:
end_date: 2014-08-21
location: Seoul, South Korea
name: 'ICM: International Congress of Mathematicans'
start_date: 2014-08-13
date_created: 2020-06-29T07:59:35Z
date_published: 2014-08-01T00:00:00Z
date_updated: 2023-10-17T11:12:33Z
day: '01'
department:
- _id: RoSe
intvolume: ' 3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.icm2014.org/en/vod/proceedings.html
month: '08'
oa: 1
oa_version: Published Version
page: 1175-1194
publication: Proceeding of the International Congress of Mathematicans
publication_identifier:
isbn:
- '9788961058063'
publication_status: published
publisher: International Congress of Mathematicians
quality_controlled: '1'
scopus_import: '1'
status: public
title: Structure of the excitation spectrum for many-body quantum systems
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3
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
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: 2023-10-17T11:12:55Z
day: '01'
department:
- _id: LaEr
ec_funded: 1
intvolume: ' 3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1407.5752
month: '08'
oa: 1
oa_version: Submitted Version
page: 214 - 236
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Proceedings of the International Congress of Mathematicians
publication_status: published
publisher: International Congress of Mathematicians
publist_id: '5670'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Random matrices, log-gases and Hölder regularity
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3
year: '2014'
...
---
_id: '1516'
abstract:
- lang: eng
text: "We present a rigorous derivation of the BCS gap equation for superfluid fermionic
gases with point interactions. Our starting point is the BCS energy functional,
whose minimizer we investigate in the limit when the range of the interaction
potential goes to zero.\r\n"
article_processing_charge: No
arxiv: 1
author:
- first_name: Gerhard
full_name: Bräunlich, Gerhard
last_name: Bräunlich
- first_name: Christian
full_name: Hainzl, Christian
last_name: Hainzl
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: 'Bräunlich G, Hainzl C, Seiringer R. On the BCS gap equation for superfluid
fermionic gases. In: Proceedings of the QMath12 Conference. World Scientific
Publishing; 2014:127-137. doi:10.1142/9789814618144_0007'
apa: 'Bräunlich, G., Hainzl, C., & Seiringer, R. (2014). On the BCS gap equation
for superfluid fermionic gases. In Proceedings of the QMath12 Conference
(pp. 127–137). Berlin, Germany: World Scientific Publishing. https://doi.org/10.1142/9789814618144_0007'
chicago: Bräunlich, Gerhard, Christian Hainzl, and Robert Seiringer. “On the BCS
Gap Equation for Superfluid Fermionic Gases.” In Proceedings of the QMath12
Conference, 127–37. World Scientific Publishing, 2014. https://doi.org/10.1142/9789814618144_0007.
ieee: G. Bräunlich, C. Hainzl, and R. Seiringer, “On the BCS gap equation for superfluid
fermionic gases,” in Proceedings of the QMath12 Conference, Berlin, Germany,
2014, pp. 127–137.
ista: 'Bräunlich G, Hainzl C, Seiringer R. 2014. On the BCS gap equation for superfluid
fermionic gases. Proceedings of the QMath12 Conference. QMath: Mathematical Results
in Quantum Physics, 127–137.'
mla: Bräunlich, Gerhard, et al. “On the BCS Gap Equation for Superfluid Fermionic
Gases.” Proceedings of the QMath12 Conference, World Scientific Publishing,
2014, pp. 127–37, doi:10.1142/9789814618144_0007.
short: G. Bräunlich, C. Hainzl, R. Seiringer, in:, Proceedings of the QMath12 Conference,
World Scientific Publishing, 2014, pp. 127–137.
conference:
end_date: 2013-09-13
location: Berlin, Germany
name: 'QMath: Mathematical Results in Quantum Physics'
start_date: 2013-09-10
date_created: 2018-12-11T11:52:28Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:51:19Z
day: '01'
department:
- _id: RoSe
doi: 10.1142/9789814618144_0007
external_id:
arxiv:
- '1403.2563'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1403.2563
month: '01'
oa: 1
oa_version: Preprint
page: 127 - 137
publication: Proceedings of the QMath12 Conference
publication_status: published
publisher: World Scientific Publishing
publist_id: '5661'
quality_controlled: '1'
status: public
title: On the BCS gap equation for superfluid fermionic gases
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '1629'
abstract:
- lang: eng
text: We propose a method for propagating edit operations in 2D vector graphics,
based on geometric relationship functions. These functions quantify the geometric
relationship of a point to a polygon, such as the distance to the boundary or
the direction to the closest corner vertex. The level sets of the relationship
functions describe points with the same relationship to a polygon. For a given
query point, we first determine a set of relationships to local features, construct
all level sets for these relationships, and accumulate them. The maxima of the
resulting distribution are points with similar geometric relationships. We show
extensions to handle mirror symmetries, and discuss the use of relationship functions
as local coordinate systems. Our method can be applied, for example, to interactive
floorplan editing, and it is especially useful for large layouts, where individual
edits would be cumbersome. We demonstrate populating 2D layouts with tens to hundreds
of objects by propagating relatively few edit operations.
article_number: '15'
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: 2021-01-12T06:52:06Z
day: '01'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/2591010
file:
- access_level: open_access
checksum: 7f91e588a4e888610313b98271e6418e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:22Z
date_updated: 2020-07-14T12:45:07Z
file_id: '4876'
file_name: IST-2016-577-v1+1_2014.TOG.Paul.EditingPropagation.final.pdf
file_size: 9832561
relation: main_file
file_date_updated: 2020-07-14T12:45:07Z
has_accepted_license: '1'
intvolume: ' 33'
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: 4435EBFC-F248-11E8-B48F-1D18A9856A87
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
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
date_created: 2018-12-11T11:53:13Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:52:12Z
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
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: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 8642
year: '2014'
...
---
_id: '1702'
abstract:
- lang: eng
text: In this paper we present INTERHORN, a solver for recursion-free Horn clauses.
The main application domain of INTERHORN lies in solving interpolation problems
arising in software verification. We show how a range of interpolation problems,
including path, transition, nested, state/transition and well-founded interpolation
can be handled directly by INTERHORN. By detailing these interpolation problems
and their Horn clause representations, we hope to encourage the emergence of a
common back-end interpolation interface useful for diverse verification tools.
alternative_title:
- EPTCS
author:
- first_name: Ashutosh
full_name: Gupta, Ashutosh
id: 335E5684-F248-11E8-B48F-1D18A9856A87
last_name: Gupta
- first_name: Corneliu
full_name: Popeea, Corneliu
last_name: Popeea
- first_name: Andrey
full_name: Rybalchenko, Andrey
last_name: Rybalchenko
citation:
ama: 'Gupta A, Popeea C, Rybalchenko A. Generalised interpolation by solving recursion
free-horn clauses. In: Electronic Proceedings in Theoretical Computer Science,
EPTCS. Vol 169. Open Publishing; 2014:31-38. doi:10.4204/EPTCS.169.5'
apa: 'Gupta, A., Popeea, C., & Rybalchenko, A. (2014). Generalised interpolation
by solving recursion free-horn clauses. In Electronic Proceedings in Theoretical
Computer Science, EPTCS (Vol. 169, pp. 31–38). Vienna, Austria: Open Publishing.
https://doi.org/10.4204/EPTCS.169.5'
chicago: Gupta, Ashutosh, Corneliu Popeea, and Andrey Rybalchenko. “Generalised
Interpolation by Solving Recursion Free-Horn Clauses.” In Electronic Proceedings
in Theoretical Computer Science, EPTCS, 169:31–38. Open Publishing, 2014.
https://doi.org/10.4204/EPTCS.169.5.
ieee: A. Gupta, C. Popeea, and A. Rybalchenko, “Generalised interpolation by solving
recursion free-horn clauses,” in Electronic Proceedings in Theoretical Computer
Science, EPTCS, Vienna, Austria, 2014, vol. 169, pp. 31–38.
ista: 'Gupta A, Popeea C, Rybalchenko A. 2014. Generalised interpolation by solving
recursion free-horn clauses. Electronic Proceedings in Theoretical Computer Science,
EPTCS. HCVS: Horn Clauses for Verification and Synthesis, EPTCS, vol. 169, 31–38.'
mla: Gupta, Ashutosh, et al. “Generalised Interpolation by Solving Recursion Free-Horn
Clauses.” Electronic Proceedings in Theoretical Computer Science, EPTCS,
vol. 169, Open Publishing, 2014, pp. 31–38, doi:10.4204/EPTCS.169.5.
short: A. Gupta, C. Popeea, A. Rybalchenko, in:, Electronic Proceedings in Theoretical
Computer Science, EPTCS, Open Publishing, 2014, pp. 31–38.
conference:
end_date: 2014-07-17
location: Vienna, Austria
name: 'HCVS: Horn Clauses for Verification and Synthesis'
start_date: 2014-07-17
date_created: 2018-12-11T11:53:33Z
date_published: 2014-12-02T00:00:00Z
date_updated: 2021-01-12T06:52:38Z
day: '02'
department:
- _id: ToHe
doi: 10.4204/EPTCS.169.5
intvolume: ' 169'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1303.7378v2
month: '12'
oa: 1
oa_version: Submitted Version
page: 31 - 38
publication: Electronic Proceedings in Theoretical Computer Science, EPTCS
publication_status: published
publisher: Open Publishing
publist_id: '5435'
quality_controlled: '1'
status: public
title: Generalised interpolation by solving recursion free-horn clauses
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 169
year: '2014'
...
---
_id: '1733'
abstract:
- lang: eng
text: The classical (boolean) notion of refinement for behavioral interfaces of
system components is the alternating refinement preorder. In this paper, we define
a distance for interfaces, called interface simulation distance. It makes the
alternating refinement preorder quantitative by, intuitively, tolerating errors
(while counting them) in the alternating simulation game. We show that the interface
simulation distance satisfies the triangle inequality, that the distance between
two interfaces does not increase under parallel composition with a third interface,
that the distance between two interfaces can be bounded from above and below by
distances between abstractions of the two interfaces, and how to synthesize an
interface from incompatible requirements. We illustrate the framework, and the
properties of the distances under composition of interfaces, with two case studies.
author:
- first_name: Pavol
full_name: Cerny, Pavol
last_name: Cerny
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- 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: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
citation:
ama: Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. Interface simulation distances.
Theoretical Computer Science. 2014;560(3):348-363. doi:10.1016/j.tcs.2014.08.019
apa: Cerny, P., Chmelik, M., Henzinger, T. A., & Radhakrishna, A. (2014). Interface
simulation distances. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2014.08.019
chicago: Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna.
“Interface Simulation Distances.” Theoretical Computer Science. Elsevier,
2014. https://doi.org/10.1016/j.tcs.2014.08.019.
ieee: P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface simulation
distances,” Theoretical Computer Science, vol. 560, no. 3. Elsevier, pp.
348–363, 2014.
ista: Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2014. Interface simulation
distances. Theoretical Computer Science. 560(3), 348–363.
mla: Cerny, Pavol, et al. “Interface Simulation Distances.” Theoretical Computer
Science, vol. 560, no. 3, Elsevier, 2014, pp. 348–63, doi:10.1016/j.tcs.2014.08.019.
short: P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, Theoretical Computer
Science 560 (2014) 348–363.
date_created: 2018-12-11T11:53:43Z
date_published: 2014-12-04T00:00:00Z
date_updated: 2023-02-23T11:04:00Z
day: '04'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1016/j.tcs.2014.08.019
ec_funded: 1
intvolume: ' 560'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1210.2450
month: '12'
oa: 1
oa_version: Submitted Version
page: 348 - 363
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
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _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
publication: Theoretical Computer Science
publication_status: published
publisher: Elsevier
publist_id: '5392'
quality_controlled: '1'
related_material:
record:
- id: '2916'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Interface simulation distances
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 560
year: '2014'
...