---
_id: '2944'
abstract:
- lang: eng
text: 'We propose a two-step procedure for estimating multiple migration rates in
an approximate Bayesian computation (ABC) framework, accounting for global nuisance
parameters. The approach is not limited to migration, but generally of interest
for inference problems with multiple parameters and a modular structure (e.g.
independent sets of demes or loci). We condition on a known, but complex demographic
model of a spatially subdivided population, motivated by the reintroduction of
Alpine ibex (Capra ibex) into Switzerland. In the first step, the global parameters
ancestral mutation rate and male mating skew have been estimated for the whole
population in Aeschbacher et al. (Genetics 2012; 192: 1027). In the second step,
we estimate in this study the migration rates independently for clusters of demes
putatively connected by migration. For large clusters (many migration rates),
ABC faces the problem of too many summary statistics. We therefore assess by simulation
if estimation per pair of demes is a valid alternative. We find that the trade-off
between reduced dimensionality for the pairwise estimation on the one hand and
lower accuracy due to the assumption of pairwise independence on the other depends
on the number of migration rates to be inferred: the accuracy of the pairwise
approach increases with the number of parameters, relative to the joint estimation
approach. To distinguish between low and zero migration, we perform ABC-type model
comparison between a model with migration and one without. Applying the approach
to microsatellite data from Alpine ibex, we find no evidence for substantial gene
flow via migration, except for one pair of demes in one direction.'
acknowledged_ssus:
- _id: ScienComp
acknowledgement: This study has made use of the computational resources provided by
IST Austria and the Edinburgh Compute and Data Facility (ECDF; http://www.ecdf.ed.ac.uk).
The ECDF is partially supported by the eDIKT initiative (http://www.edikt.org.uk).
S.A. acknowledges financial support by IST Austria, the Janggen-Pöhn Foundation,
St. Gallen, the Roche Research Foundation, Basel, the University of Edinburgh in
the form of a Torrance Studentship, and the Austrian Science Fund (FWF P21305-N13).
article_processing_charge: No
author:
- first_name: Simon
full_name: Aeschbacher, Simon
id: 2D35326E-F248-11E8-B48F-1D18A9856A87
last_name: Aeschbacher
- first_name: Andreas
full_name: Futschik, Andreas
last_name: Futschik
- first_name: Mark
full_name: Beaumont, Mark
last_name: Beaumont
citation:
ama: 'Aeschbacher S, Futschik A, Beaumont M. Approximate Bayesian computation for
modular inference problems with many parameters: the example of migration rates.
. Molecular Ecology. 2013;22(4):987-1002. doi:10.1111/mec.12165'
apa: 'Aeschbacher, S., Futschik, A., & Beaumont, M. (2013). Approximate Bayesian
computation for modular inference problems with many parameters: the example of
migration rates. . Molecular Ecology. Wiley-Blackwell. https://doi.org/10.1111/mec.12165'
chicago: 'Aeschbacher, Simon, Andreas Futschik, and Mark Beaumont. “Approximate
Bayesian Computation for Modular Inference Problems with Many Parameters: The
Example of Migration Rates. .” Molecular Ecology. Wiley-Blackwell, 2013.
https://doi.org/10.1111/mec.12165.'
ieee: 'S. Aeschbacher, A. Futschik, and M. Beaumont, “Approximate Bayesian computation
for modular inference problems with many parameters: the example of migration
rates. ,” Molecular Ecology, vol. 22, no. 4. Wiley-Blackwell, pp. 987–1002,
2013.'
ista: 'Aeschbacher S, Futschik A, Beaumont M. 2013. Approximate Bayesian computation
for modular inference problems with many parameters: the example of migration
rates. . Molecular Ecology. 22(4), 987–1002.'
mla: 'Aeschbacher, Simon, et al. “Approximate Bayesian Computation for Modular Inference
Problems with Many Parameters: The Example of Migration Rates. .” Molecular
Ecology, vol. 22, no. 4, Wiley-Blackwell, 2013, pp. 987–1002, doi:10.1111/mec.12165.'
short: S. Aeschbacher, A. Futschik, M. Beaumont, Molecular Ecology 22 (2013) 987–1002.
corr_author: '1'
date_created: 2018-12-11T12:00:28Z
date_published: 2013-02-01T00:00:00Z
date_updated: 2025-09-29T13:25:36Z
day: '01'
department:
- _id: NiBa
doi: 10.1111/mec.12165
external_id:
isi:
- '000314220900008'
intvolume: ' 22'
isi: 1
issue: '4'
language:
- iso: eng
month: '02'
oa_version: None
page: 987 - 1002
publication: Molecular Ecology
publication_status: published
publisher: Wiley-Blackwell
publist_id: '3788'
quality_controlled: '1'
related_material:
record:
- id: '9758'
relation: research_data
status: public
scopus_import: '1'
status: public
title: 'Approximate Bayesian computation for modular inference problems with many
parameters: the example of migration rates. '
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 22
year: '2013'
...
---
_id: '2948'
abstract:
- lang: eng
text: 'Many visual datasets are traditionally used to analyze the performance of
different learning techniques. The evaluation is usually done within each dataset,
therefore it is questionable if such results are a reliable indicator of true
generalization ability. We propose here an algorithm to exploit the existing data
resources when learning on a new multiclass problem. Our main idea is to identify
an image representation that decomposes orthogonally into two subspaces: a part
specific to each dataset, and a part generic to, and therefore shared between,
all the considered source sets. This allows us to use the generic representation
as un-biased reference knowledge for a novel classification task. By casting the
method in the multi-view setting, we also make it possible to use different features
for different databases. We call the algorithm MUST, Multitask Unaligned Shared
knowledge Transfer. Through extensive experiments on five public datasets, we
show that MUST consistently improves the cross-datasets generalization performance.'
acknowledgement: This work was supported by the PASCAL 2 Network of Excellence (TT)
and by the Newton International Fellowship (NQ)
alternative_title:
- LNCS
author:
- first_name: Tatiana
full_name: Tommasi, Tatiana
last_name: Tommasi
- first_name: Novi
full_name: Quadrianto, Novi
last_name: Quadrianto
- first_name: Barbara
full_name: Caputo, Barbara
last_name: Caputo
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Tommasi T, Quadrianto N, Caputo B, Lampert C. Beyond dataset bias: Multi-task
unaligned shared knowledge transfer. 2013;7724:1-15. doi:10.1007/978-3-642-37331-2_1'
apa: 'Tommasi, T., Quadrianto, N., Caputo, B., & Lampert, C. (2013). Beyond
dataset bias: Multi-task unaligned shared knowledge transfer. Presented at the
ACCV: Asian Conference on Computer Vision, Daejeon, Korea: Springer. https://doi.org/10.1007/978-3-642-37331-2_1'
chicago: 'Tommasi, Tatiana, Novi Quadrianto, Barbara Caputo, and Christoph Lampert.
“Beyond Dataset Bias: Multi-Task Unaligned Shared Knowledge Transfer.” Lecture
Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-37331-2_1.'
ieee: 'T. Tommasi, N. Quadrianto, B. Caputo, and C. Lampert, “Beyond dataset bias:
Multi-task unaligned shared knowledge transfer,” vol. 7724. Springer, pp. 1–15,
2013.'
ista: 'Tommasi T, Quadrianto N, Caputo B, Lampert C. 2013. Beyond dataset bias:
Multi-task unaligned shared knowledge transfer. 7724, 1–15.'
mla: 'Tommasi, Tatiana, et al. Beyond Dataset Bias: Multi-Task Unaligned Shared
Knowledge Transfer. Vol. 7724, Springer, 2013, pp. 1–15, doi:10.1007/978-3-642-37331-2_1.'
short: T. Tommasi, N. Quadrianto, B. Caputo, C. Lampert, 7724 (2013) 1–15.
conference:
end_date: 2012-11-09
location: Daejeon, Korea
name: 'ACCV: Asian Conference on Computer Vision'
start_date: 2012-11-05
date_created: 2018-12-11T12:00:30Z
date_published: 2013-04-04T00:00:00Z
date_updated: 2020-08-11T10:09:54Z
day: '04'
ddc:
- '000'
department:
- _id: ChLa
doi: 10.1007/978-3-642-37331-2_1
file:
- access_level: open_access
checksum: a0a7234a89e2192af655b0d0ae3bf445
content_type: application/pdf
creator: dernst
date_created: 2019-01-22T14:03:11Z
date_updated: 2020-07-14T12:45:55Z
file_id: '5874'
file_name: 2012_ACCV_Tommasi.pdf
file_size: 1513620
relation: main_file
file_date_updated: 2020-07-14T12:45:55Z
has_accepted_license: '1'
intvolume: ' 7724'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Submitted Version
page: 1 - 15
publication_status: published
publisher: Springer
publist_id: '3784'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: 'Beyond dataset bias: Multi-task unaligned shared knowledge transfer'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7724
year: '2013'
...
---
_id: '2973'
abstract:
- lang: eng
text: "Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building
blocks of many practical cryptographic applications such as identification schemes,
group signatures, and secure multiparty computation. Currently, first applications
that critically rely on ZK-PoKs are being deployed in the real world. The most
prominent example is Direct Anonymous Attestation (DAA), which was adopted by
the Trusted Computing Group (TCG) and implemented as one of the functionalities
of the cryptographic Trusted Platform Module (TPM) chip.\n\nImplementing systems
using ZK-PoK turns out to be challenging, since ZK-PoK are, loosely speaking,
significantly more complex than standard crypto primitives, such as encryption
and signature schemes. As a result, implementation cycles of ZK-PoK are time-consuming
and error-prone, in particular for developers with minor or no cryptographic skills.
\n\nIn this paper we report on our ongoing and future research vision with the
goal to bring ZK-PoK to practice by making them accessible to crypto and security
engineers. To this end we are developing compilers and related tools that support
and partially automate the design, implementation, verification and secure implementation
of ZK-PoK protocols."
acknowledgement: This work is being performed within the FP7 EU project CACE (Computer
Aided Cryptography Engineering).
alternative_title:
- LNCS
author:
- first_name: Endre
full_name: Bangerter, Endre
last_name: Bangerter
- first_name: Stefania
full_name: Barzan, Stefania
last_name: Barzan
- first_name: Stephan
full_name: Stephan Krenn
id: 329FCCF0-F248-11E8-B48F-1D18A9856A87
last_name: Krenn
orcid: 0000-0003-2835-9093
- first_name: Ahmad
full_name: Sadeghi, Ahmad-Reza
last_name: Sadeghi
- first_name: Thomas
full_name: Schneider, Thomas
last_name: Schneider
- first_name: Joe
full_name: Tsay, Joe-Kai
last_name: Tsay
citation:
ama: 'Bangerter E, Barzan S, Krenn S, Sadeghi A, Schneider T, Tsay J. Bringing Zero-Knowledge
Proofs of Knowledge to Practice. In: Christianson B, Malcolm J, Matyas V, Roe
M, eds. Vol 7028. Springer; 2013:51-62. doi:10.1007/978-3-642-36213-2_9'
apa: 'Bangerter, E., Barzan, S., Krenn, S., Sadeghi, A., Schneider, T., & Tsay,
J. (2013). Bringing Zero-Knowledge Proofs of Knowledge to Practice. In B. Christianson,
J. Malcolm, V. Matyas, & M. Roe (Eds.) (Vol. 7028, pp. 51–62). Presented at
the SPW: Security Protocols Workshop, Springer. https://doi.org/10.1007/978-3-642-36213-2_9'
chicago: Bangerter, Endre, Stefania Barzan, Stephan Krenn, Ahmad Sadeghi, Thomas
Schneider, and Joe Tsay. “Bringing Zero-Knowledge Proofs of Knowledge to Practice.”
edited by Bruce Christianson, James Malcolm, Vashek Matyas, and Michael Roe, 7028:51–62.
Springer, 2013. https://doi.org/10.1007/978-3-642-36213-2_9.
ieee: 'E. Bangerter, S. Barzan, S. Krenn, A. Sadeghi, T. Schneider, and J. Tsay,
“Bringing Zero-Knowledge Proofs of Knowledge to Practice,” presented at the SPW:
Security Protocols Workshop, 2013, vol. 7028, pp. 51–62.'
ista: 'Bangerter E, Barzan S, Krenn S, Sadeghi A, Schneider T, Tsay J. 2013. Bringing
Zero-Knowledge Proofs of Knowledge to Practice. SPW: Security Protocols Workshop,
LNCS, vol. 7028, 51–62.'
mla: Bangerter, Endre, et al. Bringing Zero-Knowledge Proofs of Knowledge to
Practice. Edited by Bruce Christianson et al., vol. 7028, Springer, 2013,
pp. 51–62, doi:10.1007/978-3-642-36213-2_9.
short: E. Bangerter, S. Barzan, S. Krenn, A. Sadeghi, T. Schneider, J. Tsay, in:,
B. Christianson, J. Malcolm, V. Matyas, M. Roe (Eds.), Springer, 2013, pp. 51–62.
conference:
name: 'SPW: Security Protocols Workshop'
date_created: 2018-12-11T12:00:38Z
date_published: 2013-01-08T00:00:00Z
date_updated: 2021-01-12T07:40:10Z
day: '08'
doi: 10.1007/978-3-642-36213-2_9
editor:
- first_name: Bruce
full_name: Christianson, Bruce
last_name: Christianson
- first_name: James
full_name: Malcolm, James A.
last_name: Malcolm
- first_name: Vashek
full_name: Matyas, Vashek
last_name: Matyas
- first_name: Michael
full_name: Roe, Michael
last_name: Roe
extern: 1
intvolume: ' 7028'
main_file_link:
- open_access: '1'
url: http://eprint.iacr.org/2009/211.pdf
month: '01'
oa: 1
page: 51 - 62
publication_status: published
publisher: Springer
publist_id: '3732'
quality_controlled: 0
status: public
title: Bringing Zero-Knowledge Proofs of Knowledge to Practice
type: conference
volume: 7028
year: '2013'
...
---
_id: '3116'
abstract:
- lang: eng
text: Multithreaded programs coordinate their interaction through synchronization
primitives like mutexes and semaphores, which are managed by an OS-provided resource
manager. We propose algorithms for the automatic construction of code-aware resource
managers for multithreaded embedded applications. Such managers use knowledge
about the structure and resource usage (mutex and semaphore usage) of the threads
to guarantee deadlock freedom and progress while managing resources in an efficient
way. Our algorithms compute managers as winning strategies in certain infinite
games, and produce a compact code description of these strategies. We have implemented
the algorithms in the tool Cynthesis. Given a multithreaded program in C, the
tool produces C code implementing a code-aware resource manager. We show in experiments
that Cynthesis produces compact resource managers within a few minutes on a set
of embedded benchmarks with up to 6 threads. © 2012 Springer Science+Business
Media, LLC.
acknowledgement: This research was supported in part by the National Science Foundation
CAREER award CCR-0132780, by the ONR grant N00014-02-1-0671, by the National Science
Foundation grants CCR-0427202 and CCR-0234690, and by the ARP award TO.030.MM.D.
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Luca
full_name: De Alfaro, Luca
last_name: De Alfaro
- first_name: Marco
full_name: Faella, Marco
last_name: Faella
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
- first_name: Vishwanath
full_name: Raman, Vishwanath
last_name: Raman
citation:
ama: Chatterjee K, De Alfaro L, Faella M, Majumdar R, Raman V. Code aware resource
management. Formal Methods in System Design. 2013;42(2):142-174. doi:10.1007/s10703-012-0170-4
apa: Chatterjee, K., De Alfaro, L., Faella, M., Majumdar, R., & Raman, V. (2013).
Code aware resource management. Formal Methods in System Design. Springer.
https://doi.org/10.1007/s10703-012-0170-4
chicago: Chatterjee, Krishnendu, Luca De Alfaro, Marco Faella, Ritankar Majumdar,
and Vishwanath Raman. “Code Aware Resource Management.” Formal Methods in System
Design. Springer, 2013. https://doi.org/10.1007/s10703-012-0170-4.
ieee: K. Chatterjee, L. De Alfaro, M. Faella, R. Majumdar, and V. Raman, “Code aware
resource management,” Formal Methods in System Design, vol. 42, no. 2.
Springer, pp. 142–174, 2013.
ista: Chatterjee K, De Alfaro L, Faella M, Majumdar R, Raman V. 2013. Code aware
resource management. Formal Methods in System Design. 42(2), 142–174.
mla: Chatterjee, Krishnendu, et al. “Code Aware Resource Management.” Formal
Methods in System Design, vol. 42, no. 2, Springer, 2013, pp. 142–74, doi:10.1007/s10703-012-0170-4.
short: K. Chatterjee, L. De Alfaro, M. Faella, R. Majumdar, V. Raman, Formal Methods
in System Design 42 (2013) 142–174.
date_created: 2018-12-11T12:01:29Z
date_published: 2013-04-01T00:00:00Z
date_updated: 2025-09-29T13:24:54Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/s10703-012-0170-4
external_id:
isi:
- '000316677500002'
intvolume: ' 42'
isi: 1
issue: '2'
language:
- iso: eng
month: '04'
oa_version: None
page: 142 - 174
publication: Formal Methods in System Design
publication_status: published
publisher: Springer
publist_id: '3583'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Code aware resource management
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 42
year: '2013'
...
---
_id: '3261'
abstract:
- lang: eng
text: Cells in a developing embryo have no direct way of "measuring" their
physical position. Through a variety of processes, however, the expression levels
of multiple genes come to be correlated with position, and these expression levels
thus form a code for "positional information." We show how to measure
this information, in bits, using the gap genes in the Drosophila embryo as an
example. Individual genes carry nearly two bits of information, twice as much
as expected if the expression patterns consisted only of on/off domains separated
by sharp boundaries. Taken together, four gap genes carry enough information to
define a cell's location with an error bar of ~1% along the anterior-posterior
axis of the embryo. This precision is nearly enough for each cell to have a unique
identity, which is the maximum information the system can use, and is nearly constant
along the length of the embryo. We argue that this constancy is a signature of
optimality in the transmission of information from primary morphogen inputs to
the output of the gap gene network.
article_processing_charge: No
author:
- first_name: Julien
full_name: Dubuis, Julien
last_name: Dubuis
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
- first_name: Eric
full_name: Wieschaus, Eric
last_name: Wieschaus
- first_name: Thomas
full_name: Gregor, Thomas
last_name: Gregor
- first_name: William
full_name: Bialek, William
last_name: Bialek
citation:
ama: Dubuis J, Tkačik G, Wieschaus E, Gregor T, Bialek W. Positional information,
in bits. PNAS. 2013;110(41):16301-16308. doi:10.1073/pnas.1315642110
apa: Dubuis, J., Tkačik, G., Wieschaus, E., Gregor, T., & Bialek, W. (2013).
Positional information, in bits. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1315642110
chicago: Dubuis, Julien, Gašper Tkačik, Eric Wieschaus, Thomas Gregor, and William
Bialek. “Positional Information, in Bits.” PNAS. National Academy of Sciences,
2013. https://doi.org/10.1073/pnas.1315642110.
ieee: J. Dubuis, G. Tkačik, E. Wieschaus, T. Gregor, and W. Bialek, “Positional
information, in bits,” PNAS, vol. 110, no. 41. National Academy of Sciences,
pp. 16301–16308, 2013.
ista: Dubuis J, Tkačik G, Wieschaus E, Gregor T, Bialek W. 2013. Positional information,
in bits. PNAS. 110(41), 16301–16308.
mla: Dubuis, Julien, et al. “Positional Information, in Bits.” PNAS, vol.
110, no. 41, National Academy of Sciences, 2013, pp. 16301–08, doi:10.1073/pnas.1315642110.
short: J. Dubuis, G. Tkačik, E. Wieschaus, T. Gregor, W. Bialek, PNAS 110 (2013)
16301–16308.
date_created: 2018-12-11T12:02:19Z
date_published: 2013-10-08T00:00:00Z
date_updated: 2025-09-29T13:24:21Z
day: '08'
ddc:
- '570'
department:
- _id: GaTk
doi: 10.1073/pnas.1315642110
external_id:
isi:
- '000325395600021'
pmid:
- '24089448'
file:
- access_level: open_access
checksum: ecd859fe52a562193027d428b5524a8d
content_type: application/pdf
creator: dernst
date_created: 2019-01-22T13:53:23Z
date_updated: 2020-07-14T12:46:06Z
file_id: '5873'
file_name: 2013_PNAS_Dubuis.pdf
file_size: 1670548
relation: main_file
file_date_updated: 2020-07-14T12:46:06Z
has_accepted_license: '1'
intvolume: ' 110'
isi: 1
issue: '41'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 16301 - 16308
pmid: 1
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '3387'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Positional information, in bits
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 110
year: '2013'
...
---
_id: '331'
abstract:
- lang: eng
text: We report a procedure to prepare highly monodisperse copper telluride nanocubes,
nanoplates, and nanorods. The procedure is based on the reaction of a copper salt
with trioctylphosphine telluride in the presence of lithium bis(trimethylsilyl)amide
and oleylamine. CuTe nanocrystals display a strong near-infrared optical absorption
associated with localized surface plasmon resonances. We exploit this plasmon
resonance for the design of surface-enhanced Raman scattering sensors for unconventional
optical probes. Furthermore, we also report here our preliminary analysis of the
use of CuTe nanocrystals as cytotoxic and photothermal agents.
article_processing_charge: No
article_type: original
author:
- first_name: Wenhua
full_name: Li, Wenhua
last_name: Li
- first_name: Reza
full_name: Zamani, Reza
last_name: Zamani
- first_name: Pilar
full_name: Rivera Gil, Pilar
last_name: Rivera Gil
- first_name: Beatriz
full_name: Pelaz, Beatriz
last_name: Pelaz
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
- first_name: Doris
full_name: Cadavid, Doris
last_name: Cadavid
- first_name: Alexey
full_name: Shavel, Alexey
last_name: Shavel
- first_name: Ramon
full_name: Alvarez Puebla, Ramon
last_name: Alvarez Puebla
- first_name: Wolfgang
full_name: Parak, Wolfgang
last_name: Parak
- first_name: Jordi
full_name: Arbiol, Jordi
last_name: Arbiol
- first_name: Andreu
full_name: Cabot, Andreu
last_name: Cabot
citation:
ama: 'Li W, Zamani R, Rivera Gil P, et al. CuTe nanocrystals: Shape and size control,
plasmonic properties, and use as SERS probes and photothermal agents. Journal
of the American Chemical Society. 2013;135(19):7098-7101. doi:10.1021/ja401428e'
apa: 'Li, W., Zamani, R., Rivera Gil, P., Pelaz, B., Ibáñez, M., Cadavid, D., …
Cabot, A. (2013). CuTe nanocrystals: Shape and size control, plasmonic properties,
and use as SERS probes and photothermal agents. Journal of the American Chemical
Society. ACS. https://doi.org/10.1021/ja401428e'
chicago: 'Li, Wenhua, Reza Zamani, Pilar Rivera Gil, Beatriz Pelaz, Maria Ibáñez,
Doris Cadavid, Alexey Shavel, et al. “CuTe Nanocrystals: Shape and Size Control,
Plasmonic Properties, and Use as SERS Probes and Photothermal Agents.” Journal
of the American Chemical Society. ACS, 2013. https://doi.org/10.1021/ja401428e.'
ieee: 'W. Li et al., “CuTe nanocrystals: Shape and size control, plasmonic
properties, and use as SERS probes and photothermal agents,” Journal of the
American Chemical Society, vol. 135, no. 19. ACS, pp. 7098–7101, 2013.'
ista: 'Li W, Zamani R, Rivera Gil P, Pelaz B, Ibáñez M, Cadavid D, Shavel A, Alvarez
Puebla R, Parak W, Arbiol J, Cabot A. 2013. CuTe nanocrystals: Shape and size
control, plasmonic properties, and use as SERS probes and photothermal agents.
Journal of the American Chemical Society. 135(19), 7098–7101.'
mla: 'Li, Wenhua, et al. “CuTe Nanocrystals: Shape and Size Control, Plasmonic Properties,
and Use as SERS Probes and Photothermal Agents.” Journal of the American Chemical
Society, vol. 135, no. 19, ACS, 2013, pp. 7098–101, doi:10.1021/ja401428e.'
short: W. Li, R. Zamani, P. Rivera Gil, B. Pelaz, M. Ibáñez, D. Cadavid, A. Shavel,
R. Alvarez Puebla, W. Parak, J. Arbiol, A. Cabot, Journal of the American Chemical
Society 135 (2013) 7098–7101.
date_created: 2018-12-11T11:45:51Z
date_published: 2013-04-30T00:00:00Z
date_updated: 2021-01-12T07:42:33Z
day: '30'
doi: 10.1021/ja401428e
extern: '1'
intvolume: ' 135'
issue: '19'
language:
- iso: eng
month: '04'
oa_version: None
page: 7098 - 7101
publication: Journal of the American Chemical Society
publication_status: published
publisher: ACS
publist_id: '7521'
quality_controlled: '1'
status: public
title: 'CuTe nanocrystals: Shape and size control, plasmonic properties, and use as
SERS probes and photothermal agents'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 135
year: '2013'
...
---
_id: '3321'
author:
- first_name: Novi
full_name: Quadrianto, Novi
last_name: Quadrianto
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Quadrianto N, Lampert C. Kernel based learning. In: Dubitzky W, Wolkenhauer
O, Cho K, Yokota H, eds. Encyclopedia of Systems Biology. Vol 3. Springer;
2013:1069-1069. doi:10.1007/978-1-4419-9863-7_604'
apa: Quadrianto, N., & Lampert, C. (2013). Kernel based learning. In W. Dubitzky,
O. Wolkenhauer, K. Cho, & H. Yokota (Eds.), Encyclopedia of Systems Biology
(Vol. 3, pp. 1069–1069). Springer. https://doi.org/10.1007/978-1-4419-9863-7_604
chicago: Quadrianto, Novi, and Christoph Lampert. “Kernel Based Learning.” In Encyclopedia
of Systems Biology, edited by Werner Dubitzky, Olaf Wolkenhauer, Kwang Cho,
and Hiroki Yokota, 3:1069–1069. Springer, 2013. https://doi.org/10.1007/978-1-4419-9863-7_604.
ieee: N. Quadrianto and C. Lampert, “Kernel based learning,” in Encyclopedia
of Systems Biology, vol. 3, W. Dubitzky, O. Wolkenhauer, K. Cho, and H. Yokota,
Eds. Springer, 2013, pp. 1069–1069.
ista: 'Quadrianto N, Lampert C. 2013.Kernel based learning. In: Encyclopedia of
Systems Biology. vol. 3, 1069–1069.'
mla: Quadrianto, Novi, and Christoph Lampert. “Kernel Based Learning.” Encyclopedia
of Systems Biology, edited by Werner Dubitzky et al., vol. 3, Springer, 2013,
pp. 1069–1069, doi:10.1007/978-1-4419-9863-7_604.
short: N. Quadrianto, C. Lampert, in:, W. Dubitzky, O. Wolkenhauer, K. Cho, H. Yokota
(Eds.), Encyclopedia of Systems Biology, Springer, 2013, pp. 1069–1069.
date_created: 2018-12-11T12:02:39Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2021-01-12T07:42:38Z
day: '01'
department:
- _id: ChLa
doi: 10.1007/978-1-4419-9863-7_604
editor:
- first_name: Werner
full_name: Dubitzky, Werner
last_name: Dubitzky
- first_name: Olaf
full_name: Wolkenhauer, Olaf
last_name: Wolkenhauer
- first_name: Kwang
full_name: Cho, Kwang
last_name: Cho
- first_name: Hiroki
full_name: Yokota, Hiroki
last_name: Yokota
intvolume: ' 3'
language:
- iso: eng
month: '01'
oa_version: None
page: 1069 - 1069
publication: Encyclopedia of Systems Biology
publication_status: published
publisher: Springer
publist_id: '3314'
quality_controlled: '1'
status: public
title: Kernel based learning
type: encyclopedia_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3
year: '2013'
...
---
_id: '342'
abstract:
- lang: eng
text: Morphology is a key parameter in the design of novel nanocrystals and nanomaterials
with controlled functional properties. Here, we demonstrate the potential of foreign
metal ions to tune the morphology of colloidal semiconductor nanoparticles. We
illustrate the underlying mechanism by preparing copper selenide nanocubes in
the presence of Al ions. We further characterize the plasmonic properties of the
obtained nanocrystals and demonstrate their potential as a platform to produce
cubic nanoparticles with different composition by cation exchange. © 2013 American
Chemical Society.
acknowledgement: The research was supported by the European Regional Development Funds.
M.I. thanks the Spanish MICINN for her Ph.D. grant. J.A. and R.Z. also acknowledge
MAT2010-15138.
article_processing_charge: No
article_type: original
author:
- first_name: Wenhua
full_name: Li, Wenhua
last_name: Li
- first_name: Reza
full_name: Zamani, Reza
last_name: Zamani
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
- first_name: Doris
full_name: Cadavid, Doris
last_name: Cadavid
- first_name: Alexey
full_name: Shavel, Alexey
last_name: Shavel
- first_name: Joan
full_name: Morante, Joan
last_name: Morante
- first_name: Jordi
full_name: Arbiol, Jordi
last_name: Arbiol
- first_name: Andreu
full_name: Cabot, Andreu
last_name: Cabot
citation:
ama: 'Li W, Zamani R, Ibáñez M, et al. Metal ions to control the morphology of semiconductor
nanoparticles: Copper selenide nanocubes. Journal of the American Chemical
Society. 2013;135(12):4664-4667. doi:10.1021/ja400472m'
apa: 'Li, W., Zamani, R., Ibáñez, M., Cadavid, D., Shavel, A., Morante, J., … Cabot,
A. (2013). Metal ions to control the morphology of semiconductor nanoparticles:
Copper selenide nanocubes. Journal of the American Chemical Society. American
Chemical Society. https://doi.org/10.1021/ja400472m'
chicago: 'Li, Wenhua, Reza Zamani, Maria Ibáñez, Doris Cadavid, Alexey Shavel, Joan
Morante, Jordi Arbiol, and Andreu Cabot. “Metal Ions to Control the Morphology
of Semiconductor Nanoparticles: Copper Selenide Nanocubes.” Journal of the
American Chemical Society. American Chemical Society, 2013. https://doi.org/10.1021/ja400472m.'
ieee: 'W. Li et al., “Metal ions to control the morphology of semiconductor
nanoparticles: Copper selenide nanocubes,” Journal of the American Chemical
Society, vol. 135, no. 12. American Chemical Society, pp. 4664–4667, 2013.'
ista: 'Li W, Zamani R, Ibáñez M, Cadavid D, Shavel A, Morante J, Arbiol J, Cabot
A. 2013. Metal ions to control the morphology of semiconductor nanoparticles:
Copper selenide nanocubes. Journal of the American Chemical Society. 135(12),
4664–4667.'
mla: 'Li, Wenhua, et al. “Metal Ions to Control the Morphology of Semiconductor
Nanoparticles: Copper Selenide Nanocubes.” Journal of the American Chemical
Society, vol. 135, no. 12, American Chemical Society, 2013, pp. 4664–67, doi:10.1021/ja400472m.'
short: W. Li, R. Zamani, M. Ibáñez, D. Cadavid, A. Shavel, J. Morante, J. Arbiol,
A. Cabot, Journal of the American Chemical Society 135 (2013) 4664–4667.
date_created: 2018-12-11T11:45:55Z
date_published: 2013-03-07T00:00:00Z
date_updated: 2021-01-12T07:43:21Z
day: '07'
doi: 10.1021/ja400472m
extern: '1'
intvolume: ' 135'
issue: '12'
language:
- iso: eng
month: '03'
oa_version: None
page: 4664 - 4667
publication: Journal of the American Chemical Society
publication_status: published
publisher: American Chemical Society
publist_id: '7482'
quality_controlled: '1'
status: public
title: 'Metal ions to control the morphology of semiconductor nanoparticles: Copper
selenide nanocubes'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 135
year: '2013'
...
---
_id: '13405'
abstract:
- lang: eng
text: We report a method for preparing electrode–molecule–electrode junctions that
incorporate nonsymmetrical azobenzene dithiols. Our approach is based on sequential
deprotection of thiol moieties originally carrying two different protecting groups.
The azobenzene derivatives retained their switching properties within monolayers
and permitted the photocontrol of electrical conductance.
article_processing_charge: No
article_type: original
author:
- first_name: Tal
full_name: Ely, Tal
last_name: Ely
- first_name: Sanjib
full_name: Das, Sanjib
last_name: Das
- first_name: Wenjie
full_name: Li, Wenjie
last_name: Li
- first_name: Pintu
full_name: Kundu, Pintu
last_name: Kundu
- first_name: Einat
full_name: Tirosh, Einat
last_name: Tirosh
- first_name: David
full_name: Cahen, David
last_name: Cahen
- first_name: Ayelet
full_name: Vilan, Ayelet
last_name: Vilan
- first_name: Rafal
full_name: Klajn, Rafal
id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b
last_name: Klajn
citation:
ama: Ely T, Das S, Li W, et al. Photocontrol of electrical conductance with a nonsymmetrical
azobenzene dithiol. Synlett. 2013;24(18):2370-2374. doi:10.1055/s-0033-1340087
apa: Ely, T., Das, S., Li, W., Kundu, P., Tirosh, E., Cahen, D., … Klajn, R. (2013).
Photocontrol of electrical conductance with a nonsymmetrical azobenzene dithiol.
Synlett. Georg Thieme Verlag. https://doi.org/10.1055/s-0033-1340087
chicago: Ely, Tal, Sanjib Das, Wenjie Li, Pintu Kundu, Einat Tirosh, David Cahen,
Ayelet Vilan, and Rafal Klajn. “Photocontrol of Electrical Conductance with a
Nonsymmetrical Azobenzene Dithiol.” Synlett. Georg Thieme Verlag, 2013.
https://doi.org/10.1055/s-0033-1340087.
ieee: T. Ely et al., “Photocontrol of electrical conductance with a nonsymmetrical
azobenzene dithiol,” Synlett, vol. 24, no. 18. Georg Thieme Verlag, pp.
2370–2374, 2013.
ista: Ely T, Das S, Li W, Kundu P, Tirosh E, Cahen D, Vilan A, Klajn R. 2013. Photocontrol
of electrical conductance with a nonsymmetrical azobenzene dithiol. Synlett. 24(18),
2370–2374.
mla: Ely, Tal, et al. “Photocontrol of Electrical Conductance with a Nonsymmetrical
Azobenzene Dithiol.” Synlett, vol. 24, no. 18, Georg Thieme Verlag, 2013,
pp. 2370–74, doi:10.1055/s-0033-1340087.
short: T. Ely, S. Das, W. Li, P. Kundu, E. Tirosh, D. Cahen, A. Vilan, R. Klajn,
Synlett 24 (2013) 2370–2374.
date_created: 2023-08-01T09:47:17Z
date_published: 2013-10-22T00:00:00Z
date_updated: 2024-10-14T12:21:03Z
day: '22'
doi: 10.1055/s-0033-1340087
extern: '1'
intvolume: ' 24'
issue: '18'
keyword:
- Organic Chemistry
language:
- iso: eng
month: '10'
oa_version: None
page: 2370-2374
publication: Synlett
publication_identifier:
eissn:
- 1437-2096
issn:
- 0936-5214
publication_status: published
publisher: Georg Thieme Verlag
quality_controlled: '1'
scopus_import: '1'
status: public
title: Photocontrol of electrical conductance with a nonsymmetrical azobenzene dithiol
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 24
year: '2013'
...
---
_id: '13406'
abstract:
- lang: eng
text: Dual-responsive nanoparticles are designed by functionalizing magnetic cores
with light-responsive ligands. These materials respond to both light and magnetic
fields and can be assembled into various higher-order structures, depending on
the relative contributions of these two stimuli.
article_processing_charge: No
article_type: original
author:
- first_name: Sanjib
full_name: Das, Sanjib
last_name: Das
- first_name: Priyadarshi
full_name: Ranjan, Priyadarshi
last_name: Ranjan
- first_name: Pradipta Sankar
full_name: Maiti, Pradipta Sankar
last_name: Maiti
- first_name: Gurvinder
full_name: Singh, Gurvinder
last_name: Singh
- first_name: Gregory
full_name: Leitus, Gregory
last_name: Leitus
- first_name: Rafal
full_name: Klajn, Rafal
id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b
last_name: Klajn
citation:
ama: Das S, Ranjan P, Maiti PS, Singh G, Leitus G, Klajn R. Dual-responsive nanoparticles
and their self-assembly. Advanced Materials. 2013;25(3):422-426. doi:10.1002/adma.201201734
apa: Das, S., Ranjan, P., Maiti, P. S., Singh, G., Leitus, G., & Klajn, R. (2013).
Dual-responsive nanoparticles and their self-assembly. Advanced Materials.
Wiley. https://doi.org/10.1002/adma.201201734
chicago: Das, Sanjib, Priyadarshi Ranjan, Pradipta Sankar Maiti, Gurvinder Singh,
Gregory Leitus, and Rafal Klajn. “Dual-Responsive Nanoparticles and Their Self-Assembly.”
Advanced Materials. Wiley, 2013. https://doi.org/10.1002/adma.201201734.
ieee: S. Das, P. Ranjan, P. S. Maiti, G. Singh, G. Leitus, and R. Klajn, “Dual-responsive
nanoparticles and their self-assembly,” Advanced Materials, vol. 25, no.
3. Wiley, pp. 422–426, 2013.
ista: Das S, Ranjan P, Maiti PS, Singh G, Leitus G, Klajn R. 2013. Dual-responsive
nanoparticles and their self-assembly. Advanced Materials. 25(3), 422–426.
mla: Das, Sanjib, et al. “Dual-Responsive Nanoparticles and Their Self-Assembly.”
Advanced Materials, vol. 25, no. 3, Wiley, 2013, pp. 422–26, doi:10.1002/adma.201201734.
short: S. Das, P. Ranjan, P.S. Maiti, G. Singh, G. Leitus, R. Klajn, Advanced Materials
25 (2013) 422–426.
date_created: 2023-08-01T09:47:30Z
date_published: 2013-01-18T00:00:00Z
date_updated: 2024-10-14T12:21:16Z
day: '18'
doi: 10.1002/adma.201201734
extern: '1'
external_id:
pmid:
- '22933327'
intvolume: ' 25'
issue: '3'
keyword:
- Mechanical Engineering
- Mechanics of Materials
- General Materials Science
language:
- iso: eng
month: '01'
oa_version: None
page: 422-426
pmid: 1
publication: Advanced Materials
publication_identifier:
issn:
- 0935-9648
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dual-responsive nanoparticles and their self-assembly
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 25
year: '2013'
...
---
_id: '1374'
abstract:
- lang: eng
text: 'We study two-player zero-sum games over infinite-state graphs equipped with
ωB and finitary conditions. Our first contribution is about the strategy complexity,
i.e the memory required for winning strategies: we prove that over general infinite-state
graphs, memoryless strategies are sufficient for finitary Büchi, and finite-memory
suffices for finitary parity games. We then study pushdown games with boundedness
conditions, with two contributions. First we prove a collapse result for pushdown
games with ωB-conditions, implying the decidability of solving these games. Second
we consider pushdown games with finitary parity along with stack boundedness conditions,
and show that solving these games is EXPTIME-complete.'
alternative_title:
- LIPIcs
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Nathanaël
full_name: Fijalkow, Nathanaël
last_name: Fijalkow
citation:
ama: 'Chatterjee K, Fijalkow N. Infinite-state games with finitary conditions. In:
22nd EACSL Annual Conference on Computer Science Logic. Vol 23. Leibniz
International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2013:181-196. doi:10.4230/LIPIcs.CSL.2013.181'
apa: 'Chatterjee, K., & Fijalkow, N. (2013). Infinite-state games with finitary
conditions. In 22nd EACSL Annual Conference on Computer Science Logic (Vol.
23, pp. 181–196). Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.CSL.2013.181'
chicago: Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with
Finitary Conditions.” In 22nd EACSL Annual Conference on Computer Science Logic,
23:181–96. Leibniz International Proceedings in Informatics. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2013. https://doi.org/10.4230/LIPIcs.CSL.2013.181.
ieee: K. Chatterjee and N. Fijalkow, “Infinite-state games with finitary conditions,”
in 22nd EACSL Annual Conference on Computer Science Logic, Torino, Italy,
2013, vol. 23, pp. 181–196.
ista: 'Chatterjee K, Fijalkow N. 2013. Infinite-state games with finitary conditions.
22nd EACSL Annual Conference on Computer Science Logic. CSL: Computer Science
LogicLeibniz International Proceedings in Informatics, LIPIcs, vol. 23, 181–196.'
mla: Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with
Finitary Conditions.” 22nd EACSL Annual Conference on Computer Science Logic,
vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 181–96,
doi:10.4230/LIPIcs.CSL.2013.181.
short: K. Chatterjee, N. Fijalkow, in:, 22nd EACSL Annual Conference on Computer
Science Logic, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 181–196.
conference:
end_date: 2013-09-05
location: Torino, Italy
name: 'CSL: Computer Science Logic'
start_date: 203-09-02
corr_author: '1'
date_created: 2018-12-11T11:51:39Z
date_published: 2013-09-01T00:00:00Z
date_updated: 2024-10-09T20:55:23Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.CSL.2013.181
ec_funded: 1
file:
- access_level: open_access
checksum: b7091a3866db573c0db5ec486952255e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:38Z
date_updated: 2020-07-14T12:44:47Z
file_id: '5023'
file_name: IST-2016-624-v1+1_ChKr_Infinite-state_games_2013_17.pdf
file_size: 547296
relation: main_file
file_date_updated: 2020-07-14T12:44:47Z
has_accepted_license: '1'
intvolume: ' 23'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 181 - 196
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: 22nd EACSL Annual Conference on Computer Science Logic
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '5837'
pubrep_id: '624'
quality_controlled: '1'
scopus_import: 1
series_title: Leibniz International Proceedings in Informatics
status: public
title: Infinite-state games with finitary conditions
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: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2013'
...
---
OA_place: repository
OA_type: green
_id: '1376'
abstract:
- lang: eng
text: 'We consider the distributed synthesis problem for temporal logic specifications.
Traditionally, the problem has been studied for LTL, and the previous results
show that the problem is decidable iff there is no information fork in the architecture.
We consider the problem for fragments of LTL and our main results are as follows:
(1) We show that the problem is undecidable for architectures with information
forks even for the fragment of LTL with temporal operators restricted to next
and eventually. (2) For specifications restricted to globally along with non-nested
next operators, we establish decidability (in EXPSPACE) for star architectures
where the processes receive disjoint inputs, whereas we establish undecidability
for architectures containing an information fork-meet structure. (3) Finally,
we consider LTL without the next operator, and establish decidability (NEXPTIME-complete)
for all architectures for a fragment that consists of a set of safety assumptions,
and a set of guarantees where each guarantee is a safety, reachability, or liveness
condition.'
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- 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: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: 'Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. Distributed synthesis
for LTL fragments. In: 13th International Conference on Formal Methods in Computer-Aided
Design. IEEE; 2013:18-25. doi:10.1109/FMCAD.2013.6679386'
apa: 'Chatterjee, K., Henzinger, T. A., Otop, J., & Pavlogiannis, A. (2013).
Distributed synthesis for LTL fragments. In 13th International Conference on
Formal Methods in Computer-Aided Design (pp. 18–25). Portland, OR, United
States: IEEE. https://doi.org/10.1109/FMCAD.2013.6679386'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Andreas Pavlogiannis.
“Distributed Synthesis for LTL Fragments.” In 13th International Conference
on Formal Methods in Computer-Aided Design, 18–25. IEEE, 2013. https://doi.org/10.1109/FMCAD.2013.6679386.
ieee: K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, “Distributed
synthesis for LTL fragments,” in 13th International Conference on Formal Methods
in Computer-Aided Design, Portland, OR, United States, 2013, pp. 18–25.
ista: 'Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis
for LTL fragments. 13th International Conference on Formal Methods in Computer-Aided
Design. FMCAD: Formal Methods in Computer-Aided Design, 18–25.'
mla: Chatterjee, Krishnendu, et al. “Distributed Synthesis for LTL Fragments.” 13th
International Conference on Formal Methods in Computer-Aided Design, IEEE,
2013, pp. 18–25, doi:10.1109/FMCAD.2013.6679386.
short: K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, in:, 13th International
Conference on Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 18–25.
conference:
end_date: 2013-10-23
location: Portland, OR, United States
name: 'FMCAD: Formal Methods in Computer-Aided Design'
start_date: 2013-10-20
corr_author: '1'
date_created: 2018-12-11T11:51:40Z
date_published: 2013-12-11T00:00:00Z
date_updated: 2025-06-26T08:33:43Z
day: '11'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1109/FMCAD.2013.6679386
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.15479/AT:IST-2013-130-v1-1
month: '12'
oa: 1
oa_version: Preprint
page: 18 - 25
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: 13th International Conference on Formal Methods in Computer-Aided Design
publication_status: published
publisher: IEEE
publist_id: '5835'
quality_controlled: '1'
related_material:
record:
- id: '5406'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Distributed synthesis for LTL fragments
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '1385'
abstract:
- lang: eng
text: It is often difficult to correctly implement a Boolean controller for a complex
system, especially when concurrency is involved. Yet, it may be easy to formally
specify a controller. For instance, for a pipelined processor it suffices to state
that the visible behavior of the pipelined system should be identical to a non-pipelined
reference system (Burch-Dill paradigm). We present a novel procedure to efficiently
synthesize multiple Boolean control signals from a specification given as a quantified
first-order formula (with a specific quantifier structure). Our approach uses
uninterpreted functions to abstract details of the design. We construct an unsatisfiable
SMT formula from the given specification. Then, from just one proof of unsatisfiability,
we use a variant of Craig interpolation to compute multiple coordinated interpolants
that implement the Boolean control signals. Our method avoids iterative learning
and back-substitution of the control functions. We applied our approach to synthesize
a controller for a simple two-stage pipelined processor, and present first experimental
results.
acknowledgement: "This research was supported by the European Commission through project\r\nDIAMOND
\ (FP7-2009-IST-4-248613), and QUAINT (I774-N23), "
arxiv: 1
author:
- first_name: Georg
full_name: Hofferek, Georg
last_name: Hofferek
- first_name: Ashutosh
full_name: Gupta, Ashutosh
id: 335E5684-F248-11E8-B48F-1D18A9856A87
last_name: Gupta
- first_name: Bettina
full_name: Könighofer, Bettina
last_name: Könighofer
- first_name: Jie
full_name: Jiang, Jie
last_name: Jiang
- first_name: Roderick
full_name: Bloem, Roderick
last_name: Bloem
citation:
ama: 'Hofferek G, Gupta A, Könighofer B, Jiang J, Bloem R. Synthesizing multiple
boolean functions using interpolation on a single proof. In: 2013 Formal Methods
in Computer-Aided Design. IEEE; 2013:77-84. doi:10.1109/FMCAD.2013.6679394'
apa: 'Hofferek, G., Gupta, A., Könighofer, B., Jiang, J., & Bloem, R. (2013).
Synthesizing multiple boolean functions using interpolation on a single proof.
In 2013 Formal Methods in Computer-Aided Design (pp. 77–84). Portland,
OR, United States: IEEE. https://doi.org/10.1109/FMCAD.2013.6679394'
chicago: Hofferek, Georg, Ashutosh Gupta, Bettina Könighofer, Jie Jiang, and Roderick
Bloem. “Synthesizing Multiple Boolean Functions Using Interpolation on a Single
Proof.” In 2013 Formal Methods in Computer-Aided Design, 77–84. IEEE, 2013.
https://doi.org/10.1109/FMCAD.2013.6679394.
ieee: G. Hofferek, A. Gupta, B. Könighofer, J. Jiang, and R. Bloem, “Synthesizing
multiple boolean functions using interpolation on a single proof,” in 2013
Formal Methods in Computer-Aided Design, Portland, OR, United States, 2013,
pp. 77–84.
ista: 'Hofferek G, Gupta A, Könighofer B, Jiang J, Bloem R. 2013. Synthesizing multiple
boolean functions using interpolation on a single proof. 2013 Formal Methods in
Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 77–84.'
mla: Hofferek, Georg, et al. “Synthesizing Multiple Boolean Functions Using Interpolation
on a Single Proof.” 2013 Formal Methods in Computer-Aided Design, IEEE,
2013, pp. 77–84, doi:10.1109/FMCAD.2013.6679394.
short: G. Hofferek, A. Gupta, B. Könighofer, J. Jiang, R. Bloem, in:, 2013 Formal
Methods in Computer-Aided Design, IEEE, 2013, pp. 77–84.
conference:
end_date: 2013-10-23
location: Portland, OR, United States
name: 'FMCAD: Formal Methods in Computer-Aided Design'
start_date: 2013-10-20
date_created: 2018-12-11T11:51:43Z
date_published: 2013-12-11T00:00:00Z
date_updated: 2024-10-21T06:02:56Z
day: '11'
department:
- _id: ToHe
doi: 10.1109/FMCAD.2013.6679394
ec_funded: 1
external_id:
arxiv:
- '1308.4767'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1308.4767
month: '12'
oa: 1
oa_version: Preprint
page: 77 - 84
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication: 2013 Formal Methods in Computer-Aided Design
publication_status: published
publisher: IEEE
publist_id: '5825'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Synthesizing multiple boolean functions using interpolation on a single proof
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '1387'
abstract:
- lang: eng
text: Choices made by nondeterministic word automata depend on both the past (the
prefix of the word read so far) and the future (the suffix yet to be read). In
several applications, most notably synthesis, the future is diverse or unknown,
leading to algorithms that are based on deterministic automata. Hoping to retain
some of the advantages of nondeterministic automata, researchers have studied
restricted classes of nondeterministic automata. Three such classes are nondeterministic
automata that are good for trees (GFT; i.e., ones that can be expanded to tree
automata accepting the derived tree languages, thus whose choices should satisfy
diverse futures), good for games (GFG; i.e., ones whose choices depend only on
the past), and determinizable by pruning (DBP; i.e., ones that embody equivalent
deterministic automata). The theoretical properties and relative merits of the
different classes are still open, having vagueness on whether they really differ
from deterministic automata. In particular, while DBP ⊆ GFG ⊆ GFT, it is not known
whether every GFT automaton is GFG and whether every GFG automaton is DBP. Also
open is the possible succinctness of GFG and GFT automata compared to deterministic
automata. We study these problems for ω-regular automata with all common acceptance
conditions. We show that GFT=GFG⊃DBP, and describe a determinization construction
for GFG automata.
acknowledgement: and ERC Grant QUALITY.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Udi
full_name: Boker, Udi
id: 31E297B6-F248-11E8-B48F-1D18A9856A87
last_name: Boker
- first_name: Denis
full_name: Kuperberg, Denis
last_name: Kuperberg
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
- first_name: Michał
full_name: Skrzypczak, Michał
last_name: Skrzypczak
citation:
ama: Boker U, Kuperberg D, Kupferman O, Skrzypczak M. Nondeterminism in the presence
of a diverse or unknown future. 2013;7966(PART 2):89-100. doi:10.1007/978-3-642-39212-2_11
apa: 'Boker, U., Kuperberg, D., Kupferman, O., & Skrzypczak, M. (2013). Nondeterminism
in the presence of a diverse or unknown future. Presented at the ICALP: Automata,
Languages and Programming, Riga, Latvia: Springer. https://doi.org/10.1007/978-3-642-39212-2_11'
chicago: Boker, Udi, Denis Kuperberg, Orna Kupferman, and Michał Skrzypczak. “Nondeterminism
in the Presence of a Diverse or Unknown Future.” Lecture Notes in Computer Science.
Springer, 2013. https://doi.org/10.1007/978-3-642-39212-2_11.
ieee: U. Boker, D. Kuperberg, O. Kupferman, and M. Skrzypczak, “Nondeterminism in
the presence of a diverse or unknown future,” vol. 7966, no. PART 2. Springer,
pp. 89–100, 2013.
ista: Boker U, Kuperberg D, Kupferman O, Skrzypczak M. 2013. Nondeterminism in the
presence of a diverse or unknown future. 7966(PART 2), 89–100.
mla: Boker, Udi, et al. Nondeterminism in the Presence of a Diverse or Unknown
Future. Vol. 7966, no. PART 2, Springer, 2013, pp. 89–100, doi:10.1007/978-3-642-39212-2_11.
short: U. Boker, D. Kuperberg, O. Kupferman, M. Skrzypczak, 7966 (2013) 89–100.
conference:
end_date: 2013-07-12
location: Riga, Latvia
name: 'ICALP: Automata, Languages and Programming'
start_date: 2013-07-08
date_created: 2018-12-11T11:51:44Z
date_published: 2013-07-01T00:00:00Z
date_updated: 2020-08-11T10:09:09Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-642-39212-2_11
ec_funded: 1
file:
- access_level: open_access
checksum: 98bc02e3793072e279ec8d364b381ff3
content_type: application/pdf
creator: dernst
date_created: 2020-05-15T11:05:50Z
date_updated: 2020-07-14T12:44:48Z
file_id: '7857'
file_name: 2013_ICALP_Boker.pdf
file_size: 276982
relation: main_file
file_date_updated: 2020-07-14T12:44:48Z
has_accepted_license: '1'
intvolume: ' 7966'
issue: PART 2
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 89 - 100
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication_status: published
publisher: Springer
publist_id: '5823'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Nondeterminism in the presence of a diverse or unknown future
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7966
year: '2013'
...
---
_id: '1405'
abstract:
- lang: eng
text: "Motivated by the analysis of highly dynamic message-passing systems, i.e.
unbounded thread creation, mobility, etc. we present a framework for the analysis
of depth-bounded systems. Depth-bounded systems are one of the most expressive
known fragment of the π-calculus for which interesting verification problems are
still decidable. Even though they are infinite state systems depth-bounded systems
are well-structured, thus can be analyzed algorithmically. We give an interpretation
of depth-bounded systems as graph-rewriting systems. This gives more flexibility
and ease of use to apply depth-bounded systems to other type of systems like shared
memory concurrency.\r\n\r\nFirst, we develop an adequate domain of limits for
depth-bounded systems, a prerequisite for the effective representation of downward-closed
sets. Downward-closed sets are needed by forward saturation-based algorithms to
represent potentially infinite sets of states. Then, we present an abstract interpretation
framework to compute the covering set of well-structured transition systems. Because,
in general, the covering set is not computable, our abstraction over-approximates
the actual covering set. Our abstraction captures the essence of acceleration
based-algorithms while giving up enough precision to ensure convergence. We have
implemented the analysis in the PICASSO tool and show that it is accurate in practice.
Finally, we build some further analyses like termination using the covering set
as starting point."
acknowledgement: "This work was supported in part by the Austrian Science Fund NFN
RiSE (Rigorous Systems Engineering) and by the ERC Advanced Grant QUAREM (Quantitative
Reactve Modeling).\r\nChapter 2, 3, and 4 are joint work with Thomas A. Henzinger
and Thomas Wies. Chapter 2 was published in FoSSaCS 2010 as “Forward Analysis of
Depth-Bounded Processes” [112]. Chapter 3 was published in VMCAI 2012 as “Ideal
Abstractions for Well-Structured Transition Systems” [114]. Chap- ter 5.1 is joint
work with Kshitij Bansal, Eric Koskinen, and Thomas Wies. It was published in TACAS
2013 as “Structural Counter Abstraction” [13]. The author’s contribution in this
part is mostly related to the implementation. The theory required to understand
the method and its implementation is quickly recalled to make the thesis self-contained,
but should not be considered as a contribution. For the details of the methods,
we refer the reader to the orig- inal publication [13] and the corresponding technical
report [14]. Chapter 5.2 is ongoing work with Shahram Esmaeilsabzali, Rupak Majumdar,
and Thomas Wies. I also would like to thank the people who supported over the past
4 years. My advisor Thomas A. Henzinger who gave me a lot of freedom to work on
projects I was interested in. My collaborators, especially Thomas Wies with whom
I worked since the beginning. The members of my thesis committee, Viktor Kun- cak
and Rupak Majumdar, who also agreed to advise me. Simon Aeschbacher, Pavol Cerny,
Cezara Dragoi, Arjun Radhakrishna, my family, friends and col- leagues who created
an enjoyable environment. "
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Damien
full_name: Zufferey, Damien
id: 4397AC76-F248-11E8-B48F-1D18A9856A87
last_name: Zufferey
orcid: 0000-0002-3197-8736
citation:
ama: Zufferey D. Analysis of dynamic message passing programs. 2013. doi:10.15479/at:ista:1405
apa: Zufferey, D. (2013). Analysis of dynamic message passing programs. Institute
of Science and Technology Austria. https://doi.org/10.15479/at:ista:1405
chicago: Zufferey, Damien. “Analysis of Dynamic Message Passing Programs.” Institute
of Science and Technology Austria, 2013. https://doi.org/10.15479/at:ista:1405.
ieee: D. Zufferey, “Analysis of dynamic message passing programs,” Institute of
Science and Technology Austria, 2013.
ista: Zufferey D. 2013. Analysis of dynamic message passing programs. Institute
of Science and Technology Austria.
mla: Zufferey, Damien. Analysis of Dynamic Message Passing Programs. Institute
of Science and Technology Austria, 2013, doi:10.15479/at:ista:1405.
short: D. Zufferey, Analysis of Dynamic Message Passing Programs, Institute of Science
and Technology Austria, 2013.
corr_author: '1'
date_created: 2018-12-11T11:51:50Z
date_published: 2013-09-05T00:00:00Z
date_updated: 2025-04-15T08:11:54Z
day: '05'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: ToHe
- _id: GradSch
doi: 10.15479/at:ista:1405
ec_funded: 1
file:
- access_level: open_access
checksum: ed2d7b52933d134e8dc69d569baa284e
content_type: application/pdf
creator: dernst
date_created: 2021-02-22T11:28:36Z
date_updated: 2021-02-22T11:28:36Z
file_id: '9176'
file_name: 2013_Zufferey_thesis_final.pdf
file_size: 1514906
relation: main_file
success: 1
- access_level: closed
checksum: cecc4c4b14225bee973d32e3dba91a55
content_type: application/pdf
creator: cchlebak
date_created: 2021-11-16T14:42:52Z
date_updated: 2021-11-17T13:47:58Z
file_id: '10298'
file_name: 2013_Zufferey_thesis_final_pdfa.pdf
file_size: 1378313
relation: main_file
file_date_updated: 2021-11-17T13:47:58Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: http://dzufferey.github.io/files/2013_thesis.pdf
month: '09'
oa: 1
oa_version: Published Version
page: '134'
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '5802'
related_material:
record:
- id: '4361'
relation: part_of_dissertation
status: public
- id: '3251'
relation: part_of_dissertation
status: public
- id: '2847'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
title: Analysis of dynamic message passing programs
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2013'
...
---
_id: '1406'
abstract:
- lang: eng
text: Epithelial spreading is a critical part of various developmental and wound
repair processes. Here we use zebrafish epiboly as a model system to study the
cellular and molecular mechanisms underlying the spreading of epithelial sheets.
During zebrafish epiboly the enveloping cell layer (EVL), a simple squamous epithelium,
spreads over the embryo to eventually cover the entire yolk cell by the end of
gastrulation. The EVL leading edge is anchored through tight junctions to the
yolk syncytial layer (YSL), where directly adjacent to the EVL margin a contractile
actomyosin ring is formed that is thought to drive EVL epiboly. The prevalent
view in the field was that the contractile ring exerts a pulling force on the
EVL margin, which pulls the EVL towards the vegetal pole. However, how this force
is generated and how it affects EVL morphology still remains elusive. Moreover,
the cellular mechanisms mediating the increase in EVL surface area, while maintaining
tissue integrity and function are still unclear. Here we show that the YSL actomyosin
ring pulls on the EVL margin by two distinct force-generating mechanisms. One
mechanism is based on contraction of the ring around its circumference, as previously
proposed. The second mechanism is based on actomyosin retrogade flows, generating
force through resistance against the substrate. The latter can function at any
epiboly stage even in situations where the contraction-based mechanism is unproductive.
Additionally, we demonstrate that during epiboly the EVL is subjected to anisotropic
tension, which guides the orientation of EVL cell division along the main axis
(animal-vegetal) of tension. The influence of tension in cell division orientation
involves cell elongation and requires myosin-2 activity for proper spindle alignment.
Strikingly, we reveal that tension-oriented cell divisions release anisotropic
tension within the EVL and that in the absence of such divisions, EVL cells undergo
ectopic fusions. We conclude that forces applied to the EVL by the action of the
YSL actomyosin ring generate a tension anisotropy in the EVL that orients cell
divisions, which in turn limit tissue tension increase thereby facilitating tissue
spreading.
acknowledged_ssus:
- _id: Bio
- _id: PreCl
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Pedro
full_name: Campinho, Pedro
id: 3AFBBC42-F248-11E8-B48F-1D18A9856A87
last_name: Campinho
orcid: 0000-0002-8526-5416
citation:
ama: 'Campinho P. Mechanics of zebrafish epiboly: Tension-oriented cell divisions
limit anisotropic tissue tension in epithelial spreading. 2013.'
apa: 'Campinho, P. (2013). Mechanics of zebrafish epiboly: Tension-oriented cell
divisions limit anisotropic tissue tension in epithelial spreading. Institute
of Science and Technology Austria.'
chicago: 'Campinho, Pedro. “Mechanics of Zebrafish Epiboly: Tension-Oriented Cell
Divisions Limit Anisotropic Tissue Tension in Epithelial Spreading.” Institute
of Science and Technology Austria, 2013.'
ieee: 'P. Campinho, “Mechanics of zebrafish epiboly: Tension-oriented cell divisions
limit anisotropic tissue tension in epithelial spreading,” Institute of Science
and Technology Austria, 2013.'
ista: 'Campinho P. 2013. Mechanics of zebrafish epiboly: Tension-oriented cell divisions
limit anisotropic tissue tension in epithelial spreading. Institute of Science
and Technology Austria.'
mla: 'Campinho, Pedro. Mechanics of Zebrafish Epiboly: Tension-Oriented Cell
Divisions Limit Anisotropic Tissue Tension in Epithelial Spreading. Institute
of Science and Technology Austria, 2013.'
short: 'P. Campinho, Mechanics of Zebrafish Epiboly: Tension-Oriented Cell Divisions
Limit Anisotropic Tissue Tension in Epithelial Spreading, Institute of Science
and Technology Austria, 2013.'
corr_author: '1'
date_created: 2018-12-11T11:51:50Z
date_published: 2013-10-01T00:00:00Z
date_updated: 2024-12-09T14:12:48Z
day: '01'
degree_awarded: PhD
department:
- _id: CaHe
language:
- iso: eng
month: '10'
oa_version: None
page: '123'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '5801'
status: public
supervisor:
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
title: 'Mechanics of zebrafish epiboly: Tension-oriented cell divisions limit anisotropic
tissue tension in epithelial spreading'
type: dissertation
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '1442'
abstract:
- lang: eng
text: We give a cohomological interpretation of both the Kac polynomial and the
refined Donaldson-Thomas-invariants of quivers. This interpretation yields a proof
of a conjecture of Kac from 1982 and gives a new perspective on recent work of
Kontsevich-Soibelman. Thisis achieved by computing, via an arithmetic Fourier
transform, the dimensions of the isotypical components of the cohomology of associated
Nakajima quiver varieties under the action of a Weyl group. The generating function
of the corresponding Poincare polynomials is an extension of Hua's formula for
Kac polynomials of quivers involving Hall-Littlewood symmetric functions. The
resulting formulae contain a wide range of information on the geometry of the
quiver varieties.
acknowledgement: |-
The first author thanks the Royal Society for funding his research 2005-2012 in the form of a Royal Society University Research Fellowship as well as the Mathematical Institute and Wadham College in Oxford for a very productive environment. The second author is supported by Agence Nationale de la Recherche grant
ANR-09-JCJC-0102-01. The third author is supported by the NSF grant DMS-1101484 and a Research Scholarship from the Clay Mathematical Institute.
author:
- first_name: Tamas
full_name: Tamas Hausel
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
- first_name: Emmanuel
full_name: Letellier, Emmanuel
last_name: Letellier
- first_name: Fernando
full_name: Rodríguez Villegas, Fernando
last_name: Rodríguez Villegas
citation:
ama: Hausel T, Letellier E, Rodríguez Villegas F. Positivity for Kac polynomials
and DT-invariants of quivers. Annals of Mathematics. 2013;177(3):1147-1168.
doi:10.4007/annals.2013.177.3.8
apa: Hausel, T., Letellier, E., & Rodríguez Villegas, F. (2013). Positivity
for Kac polynomials and DT-invariants of quivers. Annals of Mathematics.
Princeton University Press. https://doi.org/10.4007/annals.2013.177.3.8
chicago: Hausel, Tamás, Emmanuel Letellier, and Fernando Rodríguez Villegas. “Positivity
for Kac Polynomials and DT-Invariants of Quivers.” Annals of Mathematics.
Princeton University Press, 2013. https://doi.org/10.4007/annals.2013.177.3.8.
ieee: T. Hausel, E. Letellier, and F. Rodríguez Villegas, “Positivity for Kac polynomials
and DT-invariants of quivers,” Annals of Mathematics, vol. 177, no. 3.
Princeton University Press, pp. 1147–1168, 2013.
ista: Hausel T, Letellier E, Rodríguez Villegas F. 2013. Positivity for Kac polynomials
and DT-invariants of quivers. Annals of Mathematics. 177(3), 1147–1168.
mla: Hausel, Tamás, et al. “Positivity for Kac Polynomials and DT-Invariants of
Quivers.” Annals of Mathematics, vol. 177, no. 3, Princeton University
Press, 2013, pp. 1147–68, doi:10.4007/annals.2013.177.3.8.
short: T. Hausel, E. Letellier, F. Rodríguez Villegas, Annals of Mathematics 177
(2013) 1147–1168.
date_created: 2018-12-11T11:52:02Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2021-01-12T06:50:47Z
day: '01'
doi: 10.4007/annals.2013.177.3.8
extern: 1
intvolume: ' 177'
issue: '3'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1204.2375
month: '01'
oa: 1
page: 1147 - 1168
publication: Annals of Mathematics
publication_status: published
publisher: Princeton University Press
publist_id: '5754'
quality_controlled: 0
status: public
title: Positivity for Kac polynomials and DT-invariants of quivers
type: journal_article
volume: 177
year: '2013'
...
---
_id: '1443'
abstract:
- lang: eng
text: 'Here we survey several results and conjectures on the cohomology of the total
space of the Hitchin system: the moduli space of semi-stable rank n and degree
d Higgs bundles on a complex algebraic curve C. The picture emerging is a dynamic
mixture of ideas originating in theoretical physics such as gauge theory and mirror
symmetry, Weil conjectures in arithmetic algebraic geometry, representation theory
of finite groups of Lie type and Langlands duality in number theory.'
alternative_title:
- Advanced Lectures in Mathematics
author:
- first_name: Tamas
full_name: Tamas Hausel
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
citation:
ama: 'Hausel T. Global topology of the Hitchin system. In: Handbook of Moduli:
Volume II. Vol 25. International Press; 2013:29-70.'
apa: 'Hausel, T. (2013). Global topology of the Hitchin system. In Handbook of
Moduli: Volume II (Vol. 25, pp. 29–70). International Press.'
chicago: 'Hausel, Tamás. “Global Topology of the Hitchin System.” In Handbook
of Moduli: Volume II, 25:29–70. International Press, 2013.'
ieee: 'T. Hausel, “Global topology of the Hitchin system,” in Handbook of Moduli:
Volume II, vol. 25, International Press, 2013, pp. 29–70.'
ista: 'Hausel T. 2013.Global topology of the Hitchin system. In: Handbook of Moduli:
Volume II. Advanced Lectures in Mathematics, vol. 25, 29–70.'
mla: 'Hausel, Tamás. “Global Topology of the Hitchin System.” Handbook of Moduli:
Volume II, vol. 25, International Press, 2013, pp. 29–70.'
short: 'T. Hausel, in:, Handbook of Moduli: Volume II, International Press, 2013,
pp. 29–70.'
date_created: 2018-12-11T11:52:03Z
date_published: 2013-03-15T00:00:00Z
date_updated: 2021-01-12T06:50:47Z
day: '15'
extern: 1
intvolume: ' 25'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1102.1717
month: '03'
oa: 1
page: 29 - 70
publication: 'Handbook of Moduli: Volume II'
publication_status: published
publisher: International Press
publist_id: '5753'
quality_controlled: 0
status: public
title: Global topology of the Hitchin system
type: book_chapter
volume: 25
year: '2013'
...
---
_id: '1469'
abstract:
- lang: eng
text: We study connections between the topology of generic character varieties of
fundamental groups of punctured Riemann surfaces, Macdonald polynomials, quiver
representations, Hilbert schemes on Cx × Cx, modular forms and multiplicities
in tensor products of irreducible characters of finite general linear groups.
acknowledgement: During the preparation of this paper TH was supported by a Royal
Society University Research Fellowship at the University of Oxford. EL was supported
by ANR-09-JCJC-0102-01. FRV was supported by NSF grant DMS-0200605, an FRA from
the University of Texas at Austin, EPSRC grant EP/G027110/1, Visiting Fellowships
at All Souls and Wadham Colleges in Oxford and a Research Scholarship from the Clay
Mathematical Institute.
author:
- first_name: Tamas
full_name: Tamas Hausel
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
- first_name: Emmanuel
full_name: Letellier, Emmanuel
last_name: Letellier
- first_name: Fernando
full_name: Rodríguez Villegas, Fernando
last_name: Rodríguez Villegas
citation:
ama: Hausel T, Letellier E, Rodríguez Villegas F. Arithmetic harmonic analysis on
character and quiver varieties II. Advances in Mathematics. 2013;234:85-128.
doi:10.1016/j.aim.2012.10.009
apa: Hausel, T., Letellier, E., & Rodríguez Villegas, F. (2013). Arithmetic
harmonic analysis on character and quiver varieties II. Advances in Mathematics.
Academic Press. https://doi.org/10.1016/j.aim.2012.10.009
chicago: Hausel, Tamás, Emmanuel Letellier, and Fernando Rodríguez Villegas. “Arithmetic
Harmonic Analysis on Character and Quiver Varieties II.” Advances in Mathematics.
Academic Press, 2013. https://doi.org/10.1016/j.aim.2012.10.009.
ieee: T. Hausel, E. Letellier, and F. Rodríguez Villegas, “Arithmetic harmonic analysis
on character and quiver varieties II,” Advances in Mathematics, vol. 234.
Academic Press, pp. 85–128, 2013.
ista: Hausel T, Letellier E, Rodríguez Villegas F. 2013. Arithmetic harmonic analysis
on character and quiver varieties II. Advances in Mathematics. 234, 85–128.
mla: Hausel, Tamás, et al. “Arithmetic Harmonic Analysis on Character and Quiver
Varieties II.” Advances in Mathematics, vol. 234, Academic Press, 2013,
pp. 85–128, doi:10.1016/j.aim.2012.10.009.
short: T. Hausel, E. Letellier, F. Rodríguez Villegas, Advances in Mathematics 234
(2013) 85–128.
date_created: 2018-12-11T11:52:12Z
date_published: 2013-02-15T00:00:00Z
date_updated: 2021-01-12T06:50:57Z
day: '15'
doi: 10.1016/j.aim.2012.10.009
extern: 1
intvolume: ' 234'
month: '02'
page: 85 - 128
publication: Advances in Mathematics
publication_status: published
publisher: Academic Press
publist_id: '5724'
quality_controlled: 0
status: public
title: Arithmetic harmonic analysis on character and quiver varieties II
type: journal_article
volume: 234
year: '2013'
...
---
_id: '1470'
abstract:
- lang: eng
text: We show that a natural isomorphism between the rational cohomology groups
of the two zero-dimensional Hilbert schemes of n-points of two surfaces, the affine
plane minus the axes and the cotangent bundle of an elliptic curve, exchanges
the weight filtration on the first set of cohomology groups with the perverse
Leray filtration associated with a natural fibration on the second set of cohomology
groups. We discuss some associated hard Lefschetz phenomena.
acknowledgement: Mark Andrea A. de Cataldo was partially supported by N.S.A. and N.S.F.
Tamás Hausel was supported by a Royal Society University Research Fellowship. Luca
Migliorini was partially supported by PRIN 2007 project "Spazi di moduli e teoria
di Lie"
author:
- first_name: Mark
full_name: De Cataldo, Mark A
last_name: De Cataldo
- first_name: Tamas
full_name: Tamas Hausel
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
- first_name: Luca
full_name: Migliorini, Luca
last_name: Migliorini
citation:
ama: De Cataldo M, Hausel T, Migliorini L. Exchange between perverse and weight
filtration for the Hilbert schemes of points of two surfaces. Journal of Singularities.
2013;7:23-38. doi:10.5427/jsing.2013.7c
apa: De Cataldo, M., Hausel, T., & Migliorini, L. (2013). Exchange between perverse
and weight filtration for the Hilbert schemes of points of two surfaces. Journal
of Singularities. Worldwide Center of Mathematics. https://doi.org/10.5427/jsing.2013.7c
chicago: De Cataldo, Mark, Tamás Hausel, and Luca Migliorini. “Exchange between
Perverse and Weight Filtration for the Hilbert Schemes of Points of Two Surfaces.”
Journal of Singularities. Worldwide Center of Mathematics, 2013. https://doi.org/10.5427/jsing.2013.7c.
ieee: M. De Cataldo, T. Hausel, and L. Migliorini, “Exchange between perverse and
weight filtration for the Hilbert schemes of points of two surfaces,” Journal
of Singularities, vol. 7. Worldwide Center of Mathematics, pp. 23–38, 2013.
ista: De Cataldo M, Hausel T, Migliorini L. 2013. Exchange between perverse and
weight filtration for the Hilbert schemes of points of two surfaces. Journal of
Singularities. 7, 23–38.
mla: De Cataldo, Mark, et al. “Exchange between Perverse and Weight Filtration for
the Hilbert Schemes of Points of Two Surfaces.” Journal of Singularities,
vol. 7, Worldwide Center of Mathematics, 2013, pp. 23–38, doi:10.5427/jsing.2013.7c.
short: M. De Cataldo, T. Hausel, L. Migliorini, Journal of Singularities 7 (2013)
23–38.
date_created: 2018-12-11T11:52:12Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2021-01-12T06:50:58Z
day: '01'
doi: 10.5427/jsing.2013.7c
extern: 1
intvolume: ' 7'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1012.2583
month: '01'
oa: 1
page: 23 - 38
publication: Journal of Singularities
publication_status: published
publisher: Worldwide Center of Mathematics
publist_id: '5725'
quality_controlled: 0
status: public
title: Exchange between perverse and weight filtration for the Hilbert schemes of
points of two surfaces
type: journal_article
volume: 7
year: '2013'
...