---
_id: '5989'
abstract:
- lang: eng
text: Schistosomes are the causative agents of schistosomiasis, a neglected tropical
disease affecting over 230 million people worldwide.Additionally to their major
impact on human health, they are also models of choice in evolutionary biology.
These parasitic flatwormsare unique among the common hermaphroditic trematodes
as they have separate sexes. This so-called “evolutionary scandal”displays a female
heterogametic genetic sex-determination system (ZZ males and ZW females), as well
as a pronounced adult sexualdimorphism. These phenotypic differences are determined
by a shared set of genes in both sexes, potentially leading to intralocussexual
conflicts. To resolve these conflicts in sexually selected traits, molecular mechanisms
such as sex-biased gene expression couldoccur, but parent-of-origin gene expression
also provides an alternative. In this work we investigated the latter mechanism,
that is,genes expressed preferentially from either the maternal or the paternal
allele, inSchistosoma mansonispecies. To this end, tran-scriptomes from male and
female hybrid adults obtained by strain crosses were sequenced. Strain-specific
single nucleotide poly-morphism (SNP) markers allowed us to discriminate the parental
origin, while reciprocal crosses helped to differentiate parentalexpression from
strain-specific expression. We identified genes containing SNPs expressed in a
parent-of-origin manner consistentwith paternal and maternal imprints. Although
the majority of the SNPs was identified in mitochondrial and Z-specific loci,
theremaining SNPs found in male and female transcriptomes were situated in genes
that have the potential to explain sexual differencesin schistosome parasites.
Furthermore, we identified and validated four new Z-specific scaffolds.
article_processing_charge: No
author:
- first_name: Julien
full_name: Kincaid-Smith, Julien
last_name: Kincaid-Smith
- first_name: Marion A L
full_name: Picard, Marion A L
id: 2C921A7A-F248-11E8-B48F-1D18A9856A87
last_name: Picard
orcid: 0000-0002-8101-2518
- first_name: Céline
full_name: Cosseau, Céline
last_name: Cosseau
- first_name: Jérôme
full_name: Boissier, Jérôme
last_name: Boissier
- first_name: Dany
full_name: Severac, Dany
last_name: Severac
- first_name: Christoph
full_name: Grunau, Christoph
last_name: Grunau
- first_name: Eve
full_name: Toulza, Eve
last_name: Toulza
citation:
ama: Kincaid-Smith J, Picard MAL, Cosseau C, et al. Parent-of-Origin-Dependent Gene
Expression in Male and Female Schistosome Parasites. Genome Biology and Evolution.
2018;10(3):840-856. doi:10.1093/gbe/evy037
apa: Kincaid-Smith, J., Picard, M. A. L., Cosseau, C., Boissier, J., Severac, D.,
Grunau, C., & Toulza, E. (2018). Parent-of-Origin-Dependent Gene Expression
in Male and Female Schistosome Parasites. Genome Biology and Evolution.
Oxford University Press. https://doi.org/10.1093/gbe/evy037
chicago: Kincaid-Smith, Julien, Marion A L Picard, Céline Cosseau, Jérôme Boissier,
Dany Severac, Christoph Grunau, and Eve Toulza. “Parent-of-Origin-Dependent Gene
Expression in Male and Female Schistosome Parasites.” Genome Biology and Evolution.
Oxford University Press, 2018. https://doi.org/10.1093/gbe/evy037.
ieee: J. Kincaid-Smith et al., “Parent-of-Origin-Dependent Gene Expression
in Male and Female Schistosome Parasites,” Genome Biology and Evolution,
vol. 10, no. 3. Oxford University Press, pp. 840–856, 2018.
ista: Kincaid-Smith J, Picard MAL, Cosseau C, Boissier J, Severac D, Grunau C, Toulza
E. 2018. Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome
Parasites. Genome Biology and Evolution. 10(3), 840–856.
mla: Kincaid-Smith, Julien, et al. “Parent-of-Origin-Dependent Gene Expression in
Male and Female Schistosome Parasites.” Genome Biology and Evolution, vol.
10, no. 3, Oxford University Press, 2018, pp. 840–56, doi:10.1093/gbe/evy037.
short: J. Kincaid-Smith, M.A.L. Picard, C. Cosseau, J. Boissier, D. Severac, C.
Grunau, E. Toulza, Genome Biology and Evolution 10 (2018) 840–856.
date_created: 2019-02-14T12:13:52Z
date_published: 2018-03-01T00:00:00Z
date_updated: 2023-09-19T14:39:08Z
day: '01'
ddc:
- '570'
department:
- _id: BeVi
doi: 10.1093/gbe/evy037
external_id:
isi:
- '000429483700013'
file:
- access_level: open_access
checksum: 736a459cb77de5824354466bb0331caf
content_type: application/pdf
creator: dernst
date_created: 2019-02-14T12:20:01Z
date_updated: 2020-07-14T12:47:15Z
file_id: '5991'
file_name: 2018_GBE_Kincaid_Smith.pdf
file_size: 529755
relation: main_file
file_date_updated: 2020-07-14T12:47:15Z
fulldoi: https://doi.org/10.1093/gbe/evy037
has_accepted_license: '1'
intvolume: ' 10'
isi: 1
issue: '3'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '03'
oa: 1
oa_version: Published Version
page: 840-856
publication: Genome Biology and Evolution
publication_identifier:
issn:
- 1759-6653
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10
year: '2018'
...
---
_id: '5990'
abstract:
- lang: eng
text: 'A Ge–Si core–shell nanowire is used to realize a Josephson field‐effect transistor
with highly transparent contacts to superconducting leads. By changing the electric
field, access to two distinct regimes, not combined before in a single device,
is gained: in the accumulation mode the device is highly transparent and the supercurrent
is carried by multiple subbands, while near depletion, the supercurrent is carried
by single‐particle levels of a strongly coupled quantum dot operating in the few‐hole
regime. These results establish Ge–Si nanowires as an important platform for hybrid
superconductor–semiconductor physics and Majorana fermions.'
article_number: '1802257'
article_processing_charge: No
arxiv: 1
author:
- first_name: Joost
full_name: Ridderbos, Joost
last_name: Ridderbos
- first_name: Matthias
full_name: Brauns, Matthias
id: 33F94E3C-F248-11E8-B48F-1D18A9856A87
last_name: Brauns
- first_name: Jie
full_name: Shen, Jie
last_name: Shen
- first_name: Folkert K.
full_name: de Vries, Folkert K.
last_name: de Vries
- first_name: Ang
full_name: Li, Ang
last_name: Li
- first_name: Erik P. A. M.
full_name: Bakkers, Erik P. A. M.
last_name: Bakkers
- first_name: Alexander
full_name: Brinkman, Alexander
last_name: Brinkman
- first_name: Floris A.
full_name: Zwanenburg, Floris A.
last_name: Zwanenburg
citation:
ama: Ridderbos J, Brauns M, Shen J, et al. Josephson effect in a few-hole quantum
dot. Advanced Materials. 2018;30(44). doi:10.1002/adma.201802257
apa: Ridderbos, J., Brauns, M., Shen, J., de Vries, F. K., Li, A., Bakkers, E. P.
A. M., … Zwanenburg, F. A. (2018). Josephson effect in a few-hole quantum dot.
Advanced Materials. Wiley. https://doi.org/10.1002/adma.201802257
chicago: Ridderbos, Joost, Matthias Brauns, Jie Shen, Folkert K. de Vries, Ang Li,
Erik P. A. M. Bakkers, Alexander Brinkman, and Floris A. Zwanenburg. “Josephson
Effect in a Few-Hole Quantum Dot.” Advanced Materials. Wiley, 2018. https://doi.org/10.1002/adma.201802257.
ieee: J. Ridderbos et al., “Josephson effect in a few-hole quantum dot,”
Advanced Materials, vol. 30, no. 44. Wiley, 2018.
ista: Ridderbos J, Brauns M, Shen J, de Vries FK, Li A, Bakkers EPAM, Brinkman A,
Zwanenburg FA. 2018. Josephson effect in a few-hole quantum dot. Advanced Materials.
30(44), 1802257.
mla: Ridderbos, Joost, et al. “Josephson Effect in a Few-Hole Quantum Dot.” Advanced
Materials, vol. 30, no. 44, 1802257, Wiley, 2018, doi:10.1002/adma.201802257.
short: J. Ridderbos, M. Brauns, J. Shen, F.K. de Vries, A. Li, E.P.A.M. Bakkers,
A. Brinkman, F.A. Zwanenburg, Advanced Materials 30 (2018).
date_created: 2019-02-14T12:14:26Z
date_published: 2018-11-02T00:00:00Z
date_updated: 2023-09-19T14:29:58Z
day: '02'
department:
- _id: GeKa
doi: 10.1002/adma.201802257
external_id:
arxiv:
- '1809.08487'
isi:
- '000450232800015'
fulldoi: https://doi.org/10.1002/adma.201802257
intvolume: ' 30'
isi: 1
issue: '44'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1809.08487
month: '11'
oa: 1
oa_version: Preprint
publication: Advanced Materials
publication_identifier:
issn:
- 0935-9648
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Josephson effect in a few-hole quantum dot
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 30
year: '2018'
...
---
_id: '5993'
abstract:
- lang: eng
text: 'In this article, we consider the termination problem of probabilistic programs
with real-valued variables. Thequestions concerned are: qualitative ones that
ask (i) whether the program terminates with probability 1(almost-sure termination)
and (ii) whether the expected termination time is finite (finite termination);
andquantitative ones that ask (i) to approximate the expected termination time
(expectation problem) and (ii) tocompute a boundBsuch that the probability not
to terminate afterBsteps decreases exponentially (con-centration problem). To
solve these questions, we utilize the notion of ranking supermartingales, which
isa powerful approach for proving termination of probabilistic programs. In detail,
we focus on algorithmicsynthesis of linear ranking-supermartingales over affine
probabilistic programs (Apps) with both angelic anddemonic non-determinism. An
important subclass of Apps is LRApp which is defined as the class of all Appsover
which a linear ranking-supermartingale exists.Our main contributions are as follows.
Firstly, we show that the membership problem of LRApp (i) canbe decided in polynomial
time for Apps with at most demonic non-determinism, and (ii) isNP-hard and inPSPACEfor
Apps with angelic non-determinism. Moreover, theNP-hardness result holds already
for Appswithout probability and demonic non-determinism. Secondly, we show that
the concentration problem overLRApp can be solved in the same complexity as for
the membership problem of LRApp. Finally, we show thatthe expectation problem
over LRApp can be solved in2EXPTIMEand isPSPACE-hard even for Apps withoutprobability
and non-determinism (i.e., deterministic programs). Our experimental results demonstrate
theeffectiveness of our approach to answer the qualitative and quantitative questions
over Apps with at mostdemonic non-determinism.'
article_number: '7'
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Hongfei
full_name: Fu, Hongfei
id: 3AAD03D6-F248-11E8-B48F-1D18A9856A87
last_name: Fu
- first_name: Petr
full_name: Novotný, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotný
- first_name: Rouzbeh
full_name: Hasheminezhad, Rouzbeh
last_name: Hasheminezhad
citation:
ama: Chatterjee K, Fu H, Novotný P, Hasheminezhad R. Algorithmic analysis of qualitative
and quantitative termination problems for affine probabilistic programs. ACM
Transactions on Programming Languages and Systems. 2018;40(2). doi:10.1145/3174800
apa: Chatterjee, K., Fu, H., Novotný, P., & Hasheminezhad, R. (2018). Algorithmic
analysis of qualitative and quantitative termination problems for affine probabilistic
programs. ACM Transactions on Programming Languages and Systems. Association
for Computing Machinery. https://doi.org/10.1145/3174800
chicago: Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad.
“Algorithmic Analysis of Qualitative and Quantitative Termination Problems for
Affine Probabilistic Programs.” ACM Transactions on Programming Languages and
Systems. Association for Computing Machinery, 2018. https://doi.org/10.1145/3174800.
ieee: K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, “Algorithmic analysis
of qualitative and quantitative termination problems for affine probabilistic
programs,” ACM Transactions on Programming Languages and Systems, vol.
40, no. 2. Association for Computing Machinery, 2018.
ista: Chatterjee K, Fu H, Novotný P, Hasheminezhad R. 2018. Algorithmic analysis
of qualitative and quantitative termination problems for affine probabilistic
programs. ACM Transactions on Programming Languages and Systems. 40(2), 7.
mla: Chatterjee, Krishnendu, et al. “Algorithmic Analysis of Qualitative and Quantitative
Termination Problems for Affine Probabilistic Programs.” ACM Transactions on
Programming Languages and Systems, vol. 40, no. 2, 7, Association for Computing
Machinery, 2018, doi:10.1145/3174800.
short: K. Chatterjee, H. Fu, P. Novotný, R. Hasheminezhad, ACM Transactions on Programming
Languages and Systems 40 (2018).
date_created: 2019-02-14T12:29:10Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2025-04-15T08:12:22Z
day: '01'
department:
- _id: KrCh
doi: 10.1145/3174800
ec_funded: 1
external_id:
arxiv:
- '1510.08517'
isi:
- '000434634500003'
fulldoi: https://doi.org/10.1145/3174800
intvolume: ' 40'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1510.08517
month: '06'
oa: 1
oa_version: Submitted Version
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: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: ACM Transactions on Programming Languages and Systems
publication_identifier:
issn:
- 0164-0925
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '1438'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Algorithmic analysis of qualitative and quantitative termination problems for
affine probabilistic programs
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 40
year: '2018'
...
---
_id: '5998'
abstract:
- lang: eng
text: Genome amplification and cellular senescence are commonly associated with
pathological processes. While physiological roles for polyploidization and senescence
have been described in mouse development, controversy exists over their significance
in humans. Here, we describe tetraploidization and senescence as phenomena of
normal human placenta development. During pregnancy, placental extravillous trophoblasts
(EVTs) invade the pregnant endometrium, termed decidua, to establish an adapted
microenvironment required for the developing embryo. This process is critically
dependent on continuous cell proliferation and differentiation, which is thought
to follow the classical model of cell cycle arrest prior to terminal differentiation.
Strikingly, flow cytometry and DNAseq revealed that EVT formation is accompanied
with a genome-wide polyploidization, independent of mitotic cycles. DNA replication
in these cells was analysed by a fluorescent cell-cycle indicator reporter system,
cell cycle marker expression and EdU incorporation. Upon invasion into the decidua,
EVTs widely lose their replicative potential and enter a senescent state characterized
by high senescence-associated (SA) β-galactosidase activity, induction of a SA
secretory phenotype as well as typical metabolic alterations. Furthermore, we
show that the shift from endocycle-dependent genome amplification to growth arrest
is disturbed in androgenic complete hydatidiform moles (CHM), a hyperplastic pregnancy
disorder associated with increased risk of developing choriocarinoma. Senescence
is decreased in CHM-EVTs, accompanied by exacerbated endoreduplication and hyperploidy.
We propose induction of cellular senescence as a ploidy-limiting mechanism during
normal human placentation and unravel a link between excessive polyploidization
and reduced senescence in CHM.
article_number: e1007698
article_processing_charge: No
author:
- first_name: Philipp
full_name: Velicky, Philipp
id: 39BDC62C-F248-11E8-B48F-1D18A9856A87
last_name: Velicky
orcid: 0000-0002-2340-7431
- first_name: Gudrun
full_name: Meinhardt, Gudrun
last_name: Meinhardt
- first_name: Kerstin
full_name: Plessl, Kerstin
last_name: Plessl
- first_name: Sigrid
full_name: Vondra, Sigrid
last_name: Vondra
- first_name: Tamara
full_name: Weiss, Tamara
last_name: Weiss
- first_name: Peter
full_name: Haslinger, Peter
last_name: Haslinger
- first_name: Thomas
full_name: Lendl, Thomas
last_name: Lendl
- first_name: Karin
full_name: Aumayr, Karin
last_name: Aumayr
- first_name: Mario
full_name: Mairhofer, Mario
last_name: Mairhofer
- first_name: Xiaowei
full_name: Zhu, Xiaowei
last_name: Zhu
- first_name: Birgit
full_name: Schütz, Birgit
last_name: Schütz
- first_name: Roberta L.
full_name: Hannibal, Roberta L.
last_name: Hannibal
- first_name: Robert
full_name: Lindau, Robert
last_name: Lindau
- first_name: Beatrix
full_name: Weil, Beatrix
last_name: Weil
- first_name: Jan
full_name: Ernerudh, Jan
last_name: Ernerudh
- first_name: Jürgen
full_name: Neesen, Jürgen
last_name: Neesen
- first_name: Gerda
full_name: Egger, Gerda
last_name: Egger
- first_name: Mario
full_name: Mikula, Mario
last_name: Mikula
- first_name: Clemens
full_name: Röhrl, Clemens
last_name: Röhrl
- first_name: Alexander E.
full_name: Urban, Alexander E.
last_name: Urban
- first_name: Julie
full_name: Baker, Julie
last_name: Baker
- first_name: Martin
full_name: Knöfler, Martin
last_name: Knöfler
- first_name: Jürgen
full_name: Pollheimer, Jürgen
last_name: Pollheimer
citation:
ama: Velicky P, Meinhardt G, Plessl K, et al. Genome amplification and cellular
senescence are hallmarks of human placenta development. PLOS Genetics.
2018;14(10). doi:10.1371/journal.pgen.1007698
apa: Velicky, P., Meinhardt, G., Plessl, K., Vondra, S., Weiss, T., Haslinger, P.,
… Pollheimer, J. (2018). Genome amplification and cellular senescence are hallmarks
of human placenta development. PLOS Genetics. Public Library of Science.
https://doi.org/10.1371/journal.pgen.1007698
chicago: Velicky, Philipp, Gudrun Meinhardt, Kerstin Plessl, Sigrid Vondra, Tamara
Weiss, Peter Haslinger, Thomas Lendl, et al. “Genome Amplification and Cellular
Senescence Are Hallmarks of Human Placenta Development.” PLOS Genetics.
Public Library of Science, 2018. https://doi.org/10.1371/journal.pgen.1007698.
ieee: P. Velicky et al., “Genome amplification and cellular senescence are
hallmarks of human placenta development,” PLOS Genetics, vol. 14, no. 10.
Public Library of Science, 2018.
ista: Velicky P, Meinhardt G, Plessl K, Vondra S, Weiss T, Haslinger P, Lendl T,
Aumayr K, Mairhofer M, Zhu X, Schütz B, Hannibal RL, Lindau R, Weil B, Ernerudh
J, Neesen J, Egger G, Mikula M, Röhrl C, Urban AE, Baker J, Knöfler M, Pollheimer
J. 2018. Genome amplification and cellular senescence are hallmarks of human placenta
development. PLOS Genetics. 14(10), e1007698.
mla: Velicky, Philipp, et al. “Genome Amplification and Cellular Senescence Are
Hallmarks of Human Placenta Development.” PLOS Genetics, vol. 14, no. 10,
e1007698, Public Library of Science, 2018, doi:10.1371/journal.pgen.1007698.
short: P. Velicky, G. Meinhardt, K. Plessl, S. Vondra, T. Weiss, P. Haslinger, T.
Lendl, K. Aumayr, M. Mairhofer, X. Zhu, B. Schütz, R.L. Hannibal, R. Lindau, B.
Weil, J. Ernerudh, J. Neesen, G. Egger, M. Mikula, C. Röhrl, A.E. Urban, J. Baker,
M. Knöfler, J. Pollheimer, PLOS Genetics 14 (2018).
date_created: 2019-02-14T13:07:45Z
date_published: 2018-10-12T00:00:00Z
date_updated: 2023-09-19T14:31:43Z
day: '12'
ddc:
- '570'
department:
- _id: JoDa
doi: 10.1371/journal.pgen.1007698
external_id:
isi:
- '000449328500025'
file:
- access_level: open_access
checksum: 34aa9a5972f61889c19f18be8ee787a0
content_type: application/pdf
creator: kschuh
date_created: 2019-02-14T13:14:35Z
date_updated: 2020-07-14T12:47:15Z
file_id: '6000'
file_name: 2018_PLOS_Velicky.pdf
file_size: 4592947
relation: main_file
file_date_updated: 2020-07-14T12:47:15Z
fulldoi: https://doi.org/10.1371/journal.pgen.1007698
has_accepted_license: '1'
intvolume: ' 14'
isi: 1
issue: '10'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
publication: PLOS Genetics
publication_identifier:
issn:
- 1553-7404
publication_status: published
publisher: Public Library of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: Genome amplification and cellular senescence are hallmarks of human placenta
development
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 14
year: '2018'
...
---
_id: '5999'
abstract:
- lang: eng
text: "We introduce for each quiver Q and each algebraic oriented cohomology theory
A, the cohomological Hall algebra (CoHA) of Q, as the A-homology of the moduli
of representations of the preprojective algebra of Q. This generalizes the K-theoretic
Hall algebra of commuting varieties defined by Schiffmann-Vasserot. When A is
the Morava K-theory, we show evidence that this algebra is a candidate for Lusztig's
reformulated conjecture on modular representations of algebraic groups.\r\nWe
construct an action of the preprojective CoHA on the A-homology of Nakajima quiver
varieties. We compare this with the action of the Borel subalgebra of Yangian
when A is the intersection theory. We also give a shuffle algebra description
of this CoHA in terms of the underlying formal group law of A. As applications,
we obtain a shuffle description of the Yangian. "
article_processing_charge: No
arxiv: 1
author:
- first_name: Yaping
full_name: Yang, Yaping
last_name: Yang
- first_name: Gufang
full_name: Zhao, Gufang
id: 2BC2AC5E-F248-11E8-B48F-1D18A9856A87
last_name: Zhao
citation:
ama: Yang Y, Zhao G. The cohomological Hall algebra of a preprojective algebra.
Proceedings of the London Mathematical Society. 2018;116(5):1029-1074.
doi:10.1112/plms.12111
apa: Yang, Y., & Zhao, G. (2018). The cohomological Hall algebra of a preprojective
algebra. Proceedings of the London Mathematical Society. Oxford University
Press. https://doi.org/10.1112/plms.12111
chicago: Yang, Yaping, and Gufang Zhao. “The Cohomological Hall Algebra of a Preprojective
Algebra.” Proceedings of the London Mathematical Society. Oxford University
Press, 2018. https://doi.org/10.1112/plms.12111.
ieee: Y. Yang and G. Zhao, “The cohomological Hall algebra of a preprojective algebra,”
Proceedings of the London Mathematical Society, vol. 116, no. 5. Oxford
University Press, pp. 1029–1074, 2018.
ista: Yang Y, Zhao G. 2018. The cohomological Hall algebra of a preprojective algebra.
Proceedings of the London Mathematical Society. 116(5), 1029–1074.
mla: Yang, Yaping, and Gufang Zhao. “The Cohomological Hall Algebra of a Preprojective
Algebra.” Proceedings of the London Mathematical Society, vol. 116, no.
5, Oxford University Press, 2018, pp. 1029–74, doi:10.1112/plms.12111.
short: Y. Yang, G. Zhao, Proceedings of the London Mathematical Society 116 (2018)
1029–1074.
date_created: 2019-02-14T13:14:22Z
date_published: 2018-05-01T00:00:00Z
date_updated: 2023-09-19T14:37:19Z
day: '01'
department:
- _id: TaHa
doi: 10.1112/plms.12111
external_id:
arxiv:
- '1407.7994'
isi:
- '000431506400001'
fulldoi: https://doi.org/10.1112/plms.12111
intvolume: ' 116'
isi: 1
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1407.7994
month: '05'
oa: 1
oa_version: Preprint
page: 1029-1074
publication: Proceedings of the London Mathematical Society
publication_identifier:
issn:
- 0024-6115
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: The cohomological Hall algebra of a preprojective algebra
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 116
year: '2018'
...
---
_id: '60'
abstract:
- lang: eng
text: Model checking is a computer-assisted method for the analysis of dynamical
systems that can be modeled by state-transition systems. Drawing from research
traditions in mathematical logic, programming languages, hardware design, and
theoretical computer science, model checking is now widely used for the verification
of hardware and software in industry. This chapter is an introduction and short
survey of model checking. The chapter aims to motivate and link the individual
chapters of the handbook, and to provide context for readers who are not familiar
with model checking.
author:
- first_name: Edmund
full_name: Clarke, Edmund
last_name: Clarke
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Helmut
full_name: Veith, Helmut
last_name: Veith
citation:
ama: 'Clarke E, Henzinger TA, Veith H. Introduction to model checking. In: Henzinger
TA, ed. Handbook of Model Checking. Handbook of Model Checking. Springer;
2018:1-26. doi:10.1007/978-3-319-10575-8_1'
apa: Clarke, E., Henzinger, T. A., & Veith, H. (2018). Introduction to model
checking. In T. A. Henzinger (Ed.), Handbook of Model Checking (pp. 1–26).
Springer. https://doi.org/10.1007/978-3-319-10575-8_1
chicago: Clarke, Edmund, Thomas A Henzinger, and Helmut Veith. “Introduction to
Model Checking.” In Handbook of Model Checking, edited by Thomas A Henzinger,
1–26. Handbook of Model Checking. Springer, 2018. https://doi.org/10.1007/978-3-319-10575-8_1.
ieee: E. Clarke, T. A. Henzinger, and H. Veith, “Introduction to model checking,”
in Handbook of Model Checking, T. A. Henzinger, Ed. Springer, 2018, pp.
1–26.
ista: 'Clarke E, Henzinger TA, Veith H. 2018.Introduction to model checking. In:
Handbook of Model Checking. , 1–26.'
mla: Clarke, Edmund, et al. “Introduction to Model Checking.” Handbook of Model
Checking, edited by Thomas A Henzinger, Springer, 2018, pp. 1–26, doi:10.1007/978-3-319-10575-8_1.
short: E. Clarke, T.A. Henzinger, H. Veith, in:, T.A. Henzinger (Ed.), Handbook
of Model Checking, Springer, 2018, pp. 1–26.
date_created: 2018-12-11T11:44:25Z
date_published: 2018-05-19T00:00:00Z
date_updated: 2021-01-12T08:05:35Z
day: '19'
department:
- _id: ToHe
doi: 10.1007/978-3-319-10575-8_1
editor:
- first_name: Thomas A
full_name: Henzinger, Thomas A
last_name: Henzinger
fulldoi: https://doi.org/10.1007/978-3-319-10575-8_1
language:
- iso: eng
month: '05'
oa_version: None
page: 1 - 26
publication: Handbook of Model Checking
publication_status: published
publisher: Springer
publist_id: '7994'
quality_controlled: '1'
scopus_import: 1
series_title: Handbook of Model Checking
status: public
title: Introduction to model checking
type: book_chapter
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '6001'
abstract:
- lang: eng
text: "The concurrent memory reclamation problem is that of devising a way for a
deallocating thread to verify that no other concurrent threads hold references
to a memory block being deallocated. To date, in the absence of automatic garbage
collection, there is no satisfactory solution to this problem; existing tracking
methods like hazard pointers, reference counters, or epoch-based techniques like
RCU are either prohibitively expensive or require significant programming expertise
to the extent that implementing them efficiently can be worthy of a publication.
None of the existing techniques are automatic or even semi-automated.\r\nIn this
article, we take a new approach to concurrent memory reclamation. Instead of manually
tracking access to memory locations as done in techniques like hazard pointers,
or restricting shared accesses to specific epoch boundaries as in RCU, our algorithm,
called ThreadScan, leverages operating system signaling to automatically detect
which memory locations are being accessed by concurrent threads.\r\nInitial empirical
evidence shows that ThreadScan scales surprisingly well and requires negligible
programming effort beyond the standard use of Malloc and Free."
article_number: '18'
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: William
full_name: Leiserson, William
last_name: Leiserson
- 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, Leiserson W, Matveev A, Shavit N. ThreadScan: Automatic and
scalable memory reclamation. ACM Transactions on Parallel Computing. 2018;4(4).
doi:10.1145/3201897'
apa: 'Alistarh, D.-A., Leiserson, W., Matveev, A., & Shavit, N. (2018). ThreadScan:
Automatic and scalable memory reclamation. ACM Transactions on Parallel Computing.
Association for Computing Machinery. https://doi.org/10.1145/3201897'
chicago: 'Alistarh, Dan-Adrian, William Leiserson, Alexander Matveev, and Nir Shavit.
“ThreadScan: Automatic and Scalable Memory Reclamation.” ACM Transactions on
Parallel Computing. Association for Computing Machinery, 2018. https://doi.org/10.1145/3201897.'
ieee: 'D.-A. Alistarh, W. Leiserson, A. Matveev, and N. Shavit, “ThreadScan: Automatic
and scalable memory reclamation,” ACM Transactions on Parallel Computing,
vol. 4, no. 4. Association for Computing Machinery, 2018.'
ista: 'Alistarh D-A, Leiserson W, Matveev A, Shavit N. 2018. ThreadScan: Automatic
and scalable memory reclamation. ACM Transactions on Parallel Computing. 4(4),
18.'
mla: 'Alistarh, Dan-Adrian, et al. “ThreadScan: Automatic and Scalable Memory Reclamation.”
ACM Transactions on Parallel Computing, vol. 4, no. 4, 18, Association
for Computing Machinery, 2018, doi:10.1145/3201897.'
short: D.-A. Alistarh, W. Leiserson, A. Matveev, N. Shavit, ACM Transactions on
Parallel Computing 4 (2018).
date_created: 2019-02-14T13:24:11Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2023-02-23T13:17:54Z
day: '01'
department:
- _id: DaAl
doi: 10.1145/3201897
fulldoi: https://doi.org/10.1145/3201897
intvolume: ' 4'
issue: '4'
language:
- iso: eng
month: '09'
oa_version: None
publication: ACM Transactions on Parallel Computing
publication_identifier:
issn:
- 2329-4949
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '779'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: 'ThreadScan: Automatic and scalable memory reclamation'
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2018'
...
---
_id: '6002'
abstract:
- lang: eng
text: The Bogoliubov free energy functional is analysed. The functional serves as
a model of a translation-invariant Bose gas at positive temperature. We prove
the existence of minimizers in the case of repulsive interactions given by a sufficiently
regular two-body potential. Furthermore, we prove the existence of a phase transition
in this model and provide its phase diagram.
article_processing_charge: No
arxiv: 1
author:
- first_name: Marcin M
full_name: Napiórkowski, Marcin M
id: 4197AD04-F248-11E8-B48F-1D18A9856A87
last_name: Napiórkowski
- first_name: Robin
full_name: Reuvers, Robin
last_name: Reuvers
- first_name: Jan Philip
full_name: Solovej, Jan Philip
last_name: Solovej
citation:
ama: 'Napiórkowski MM, Reuvers R, Solovej JP. The Bogoliubov free energy functional
I: Existence of minimizers and phase diagram. Archive for Rational Mechanics
and Analysis. 2018;229(3):1037-1090. doi:10.1007/s00205-018-1232-6'
apa: 'Napiórkowski, M. M., Reuvers, R., & Solovej, J. P. (2018). The Bogoliubov
free energy functional I: Existence of minimizers and phase diagram. Archive
for Rational Mechanics and Analysis. Springer Nature. https://doi.org/10.1007/s00205-018-1232-6'
chicago: 'Napiórkowski, Marcin M, Robin Reuvers, and Jan Philip Solovej. “The Bogoliubov
Free Energy Functional I: Existence of Minimizers and Phase Diagram.” Archive
for Rational Mechanics and Analysis. Springer Nature, 2018. https://doi.org/10.1007/s00205-018-1232-6.'
ieee: 'M. M. Napiórkowski, R. Reuvers, and J. P. Solovej, “The Bogoliubov free energy
functional I: Existence of minimizers and phase diagram,” Archive for Rational
Mechanics and Analysis, vol. 229, no. 3. Springer Nature, pp. 1037–1090, 2018.'
ista: 'Napiórkowski MM, Reuvers R, Solovej JP. 2018. The Bogoliubov free energy
functional I: Existence of minimizers and phase diagram. Archive for Rational
Mechanics and Analysis. 229(3), 1037–1090.'
mla: 'Napiórkowski, Marcin M., et al. “The Bogoliubov Free Energy Functional I:
Existence of Minimizers and Phase Diagram.” Archive for Rational Mechanics
and Analysis, vol. 229, no. 3, Springer Nature, 2018, pp. 1037–90, doi:10.1007/s00205-018-1232-6.'
short: M.M. Napiórkowski, R. Reuvers, J.P. Solovej, Archive for Rational Mechanics
and Analysis 229 (2018) 1037–1090.
date_created: 2019-02-14T13:40:53Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2025-04-15T08:26:15Z
day: '01'
department:
- _id: RoSe
doi: 10.1007/s00205-018-1232-6
external_id:
arxiv:
- '1511.05935'
isi:
- '000435367300003'
fulldoi: https://doi.org/10.1007/s00205-018-1232-6
intvolume: ' 229'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1511.05935
month: '09'
oa: 1
oa_version: Preprint
page: 1037-1090
project:
- _id: 25C878CE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P27533_N27
name: Structure of the Excitation Spectrum for Many-Body Quantum Systems
publication: Archive for Rational Mechanics and Analysis
publication_identifier:
eissn:
- 1432-0673
issn:
- 0003-9527
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The Bogoliubov free energy functional I: Existence of minimizers and phase
diagram'
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 229
year: '2018'
...
---
_id: '6003'
abstract:
- lang: eng
text: Digital fabrication devices are powerful tools for creating tangible reproductions
of 3D digital models. Most available printing technologies aim at producing an
accurate copy of a tridimensional shape. However, fabrication technologies can
also be used to create a stylistic representation of a digital shape. We refer
to this class of methods as ‘stylized fabrication methods’. These methods abstract
geometric and physical features of a given shape to create an unconventional representation,
to produce an optical illusion or to devise a particular interaction with the
fabricated model. In this state‐of‐the‐art report, we classify and overview this
broad and emerging class of approaches and also propose possible directions for
future research.
article_processing_charge: No
author:
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Paolo
full_name: Cignoni, Paolo
last_name: Cignoni
- first_name: Luigi
full_name: Malomo, Luigi
last_name: Malomo
- first_name: Nico
full_name: Pietroni, Nico
last_name: Pietroni
citation:
ama: Bickel B, Cignoni P, Malomo L, Pietroni N. State of the art on stylized fabrication.
Computer Graphics Forum. 2018;37(6):325-342. doi:10.1111/cgf.13327
apa: Bickel, B., Cignoni, P., Malomo, L., & Pietroni, N. (2018). State of the
art on stylized fabrication. Computer Graphics Forum. Wiley. https://doi.org/10.1111/cgf.13327
chicago: Bickel, Bernd, Paolo Cignoni, Luigi Malomo, and Nico Pietroni. “State of
the Art on Stylized Fabrication.” Computer Graphics Forum. Wiley, 2018.
https://doi.org/10.1111/cgf.13327.
ieee: B. Bickel, P. Cignoni, L. Malomo, and N. Pietroni, “State of the art on stylized
fabrication,” Computer Graphics Forum, vol. 37, no. 6. Wiley, pp. 325–342,
2018.
ista: Bickel B, Cignoni P, Malomo L, Pietroni N. 2018. State of the art on stylized
fabrication. Computer Graphics Forum. 37(6), 325–342.
mla: Bickel, Bernd, et al. “State of the Art on Stylized Fabrication.” Computer
Graphics Forum, vol. 37, no. 6, Wiley, 2018, pp. 325–42, doi:10.1111/cgf.13327.
short: B. Bickel, P. Cignoni, L. Malomo, N. Pietroni, Computer Graphics Forum 37
(2018) 325–342.
date_created: 2019-02-14T13:52:25Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2025-04-14T07:28:57Z
day: '01'
ddc:
- '004'
department:
- _id: BeBi
doi: 10.1111/cgf.13327
ec_funded: 1
external_id:
isi:
- '000437272800019'
file:
- access_level: open_access
checksum: d2bbe5c658d8159fbe9016a4f5e82b19
content_type: application/pdf
creator: kschuh
date_created: 2019-02-14T14:09:28Z
date_updated: 2020-07-14T12:47:15Z
file_id: '6004'
file_name: StylizedFabricationSTAR-Personal.pdf
file_size: 6209349
relation: main_file
file_date_updated: 2020-07-14T12:47:15Z
fulldoi: https://doi.org/10.1111/cgf.13327
has_accepted_license: '1'
intvolume: ' 37'
isi: 1
issue: '6'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 325-342
project:
- _id: 24F9549A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715767'
name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and
Modeling'
publication: Computer Graphics Forum
publication_identifier:
issn:
- 0167-7055
publication_status: published
publisher: Wiley
pubrep_id: '1051'
quality_controlled: '1'
scopus_import: '1'
status: public
title: State of the art on stylized fabrication
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 37
year: '2018'
...
---
_id: '6005'
abstract:
- lang: eng
text: Network games are widely used as a model for selfish resource-allocation problems.
In the classicalmodel, each player selects a path connecting her source and target
vertices. The cost of traversingan edge depends on theload; namely, number of
players that traverse it. Thus, it abstracts the factthat different users may
use a resource at different times and for different durations, which playsan important
role in determining the costs of the users in reality. For example, when transmittingpackets
in a communication network, routing traffic in a road network, or processing a
task in aproduction system, actual sharing and congestion of resources crucially
depends on time.In [13], we introducedtimed network games, which add a time component
to network games.Each vertexvin the network is associated with a cost function,
mapping the load onvto theprice that a player pays for staying invfor one time
unit with this load. Each edge in thenetwork is guarded by the time intervals
in which it can be traversed, which forces the players tospend time in the vertices.
In this work we significantly extend the way time can be referred toin timed network
games. In the model we study, the network is equipped withclocks, and, as intimed
automata, edges are guarded by constraints on the values of the clocks, and their
traversalmay involve a reset of some clocks. We argue that the stronger model
captures many realisticnetworks. The addition of clocks breaks the techniques
we developed in [13] and we developnew techniques in order to show that positive
results on classic network games carry over to thestronger timed setting.
alternative_title:
- LIPIcs
article_number: '23'
article_processing_charge: No
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Shibashis
full_name: Guha, Shibashis
last_name: Guha
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: 'Avni G, Guha S, Kupferman O. Timed network games with clocks. In: Vol 117.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPICS.MFCS.2018.23'
apa: 'Avni, G., Guha, S., & Kupferman, O. (2018). Timed network games with clocks
(Vol. 117). Presented at the MFCS: Mathematical Foundations of Computer Science,
Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPICS.MFCS.2018.23'
chicago: Avni, Guy, Shibashis Guha, and Orna Kupferman. “Timed Network Games with
Clocks,” Vol. 117. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.MFCS.2018.23.
ieee: 'G. Avni, S. Guha, and O. Kupferman, “Timed network games with clocks,” presented
at the MFCS: Mathematical Foundations of Computer Science, Liverpool, United Kingdom,
2018, vol. 117.'
ista: 'Avni G, Guha S, Kupferman O. 2018. Timed network games with clocks. MFCS:
Mathematical Foundations of Computer Science, LIPIcs, vol. 117, 23.'
mla: Avni, Guy, et al. Timed Network Games with Clocks. Vol. 117, 23, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.MFCS.2018.23.
short: G. Avni, S. Guha, O. Kupferman, in:, Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2018.
conference:
end_date: 2018-08-31
location: Liverpool, United Kingdom
name: 'MFCS: Mathematical Foundations of Computer Science'
start_date: 2018-08-27
date_created: 2019-02-14T14:12:09Z
date_published: 2018-08-01T00:00:00Z
date_updated: 2025-07-10T12:01:59Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPICS.MFCS.2018.23
file:
- access_level: open_access
checksum: 41ab2ae9b63f5eb49fa995250c0ba128
content_type: application/pdf
creator: dernst
date_created: 2019-02-14T14:22:04Z
date_updated: 2020-07-14T12:47:15Z
file_id: '6007'
file_name: 2018_LIPIcs_Avni.pdf
file_size: 542889
relation: main_file
file_date_updated: 2020-07-14T12:47:15Z
fulldoi: https://doi.org/10.4230/LIPICS.MFCS.2018.23
has_accepted_license: '1'
intvolume: ' 117'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 264B3912-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02369
name: Formal Methods meets Algorithmic Game Theory
publication_identifier:
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '963'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Timed network games with clocks
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: 117
year: '2018'
...
---
_id: '6006'
abstract:
- lang: eng
text: 'Network games (NGs) are played on directed graphs and are extensively used
in network design and analysis. Search problems for NGs include finding special
strategy profiles such as a Nash equilibrium and a globally-optimal solution.
The networks modeled by NGs may be huge. In formal verification, abstraction has
proven to be an extremely effective technique for reasoning about systems with
big and even infinite state spaces. We describe an abstraction-refinement methodology
for reasoning about NGs. Our methodology is based on an abstraction function that
maps the state space of an NG to a much smaller state space. We search for a global
optimum and a Nash equilibrium by reasoning on an under- and an over-approximation
defined on top of this smaller state space. When the approximations are too coarse
to find such profiles, we refine the abstraction function. We extend the abstraction-refinement
methodology to labeled networks, where the objectives of the players are regular
languages. Our experimental results demonstrate the effectiveness of the methodology. '
article_number: '39'
article_processing_charge: No
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Shibashis
full_name: Guha, Shibashis
last_name: Guha
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: Avni G, Guha S, Kupferman O. An abstraction-refinement methodology for reasoning
about network games. Games. 2018;9(3). doi:10.3390/g9030039
apa: Avni, G., Guha, S., & Kupferman, O. (2018). An abstraction-refinement methodology
for reasoning about network games. Games. MDPI. https://doi.org/10.3390/g9030039
chicago: Avni, Guy, Shibashis Guha, and Orna Kupferman. “An Abstraction-Refinement
Methodology for Reasoning about Network Games.” Games. MDPI, 2018. https://doi.org/10.3390/g9030039.
ieee: G. Avni, S. Guha, and O. Kupferman, “An abstraction-refinement methodology
for reasoning about network games,” Games, vol. 9, no. 3. MDPI, 2018.
ista: Avni G, Guha S, Kupferman O. 2018. An abstraction-refinement methodology for
reasoning about network games. Games. 9(3), 39.
mla: Avni, Guy, et al. “An Abstraction-Refinement Methodology for Reasoning about
Network Games.” Games, vol. 9, no. 3, 39, MDPI, 2018, doi:10.3390/g9030039.
short: G. Avni, S. Guha, O. Kupferman, Games 9 (2018).
date_created: 2019-02-14T14:17:54Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2025-07-10T11:49:38Z
day: '01'
ddc:
- '004'
department:
- _id: ToHe
doi: 10.3390/g9030039
file:
- access_level: open_access
checksum: 749d65ca4ce74256a029d9644a1b1cb0
content_type: application/pdf
creator: kschuh
date_created: 2019-02-14T14:20:31Z
date_updated: 2020-07-14T12:47:16Z
file_id: '6008'
file_name: 2018_MDPI_Avni.pdf
file_size: 505155
relation: main_file
file_date_updated: 2020-07-14T12:47:16Z
fulldoi: https://doi.org/10.3390/g9030039
has_accepted_license: '1'
intvolume: ' 9'
issue: '3'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 264B3912-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02369
name: Formal Methods meets Algorithmic Game Theory
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication: Games
publication_identifier:
issn:
- 2073-4336
publication_status: published
publisher: MDPI
quality_controlled: '1'
related_material:
record:
- id: '1003'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: An abstraction-refinement methodology for reasoning about network games
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: 9
year: '2018'
...
---
_id: '6010'
abstract:
- lang: eng
text: The optic tectum (TeO), or superior colliculus, is a multisensory midbrain
center that organizes spatially orienting responses to relevant stimuli. To define
the stimulus with the highest priority at each moment, a network of reciprocal
connections between the TeO and the isthmi promotes competition between concurrent
tectal inputs. In the avian midbrain, the neurons mediating enhancement and suppression
of tectal inputs are located in separate isthmic nuclei, facilitating the analysis
of the neural processes that mediate competition. A specific subset of radial
neurons in the intermediate tectal layers relay retinal inputs to the isthmi,
but at present it is unclear whether separate neurons innervate individual nuclei
or a single neural type sends a common input to several of them. In this study,
we used in vitro neural tracing and cell-filling experiments in chickens to show
that single neurons innervate, via axon collaterals, the three nuclei that comprise
the isthmotectal network. This demonstrates that the input signals representing
the strength of the incoming stimuli are simultaneously relayed to the mechanisms
promoting both enhancement and suppression of the input signals. By performing
in vivo recordings in anesthetized chicks, we also show that this common input
generates synchrony between both antagonistic mechanisms, demonstrating that activity
enhancement and suppression are closely coordinated. From a computational point
of view, these results suggest that these tectal neurons constitute integrative
nodes that combine inputs from different sources to drive in parallel several
concurrent neural processes, each performing complementary functions within the
network through different firing patterns and connectivity.
article_processing_charge: No
author:
- first_name: Florencia
full_name: Garrido-Charad, Florencia
last_name: Garrido-Charad
- first_name: Tomas A
full_name: Vega Zuniga, Tomas A
id: 2E7C4E78-F248-11E8-B48F-1D18A9856A87
last_name: Vega Zuniga
- first_name: Cristián
full_name: Gutiérrez-Ibáñez, Cristián
last_name: Gutiérrez-Ibáñez
- first_name: Pedro
full_name: Fernandez, Pedro
last_name: Fernandez
- first_name: Luciana
full_name: López-Jury, Luciana
last_name: López-Jury
- first_name: Cristian
full_name: González-Cabrera, Cristian
last_name: González-Cabrera
- first_name: Harvey J.
full_name: Karten, Harvey J.
last_name: Karten
- first_name: Harald
full_name: Luksch, Harald
last_name: Luksch
- first_name: Gonzalo J.
full_name: Marín, Gonzalo J.
last_name: Marín
citation:
ama: Garrido-Charad F, Vega Zuniga TA, Gutiérrez-Ibáñez C, et al. “Shepherd’s crook”
neurons drive and synchronize the enhancing and suppressive mechanisms of the
midbrain stimulus selection network. Proceedings of the National Academy of
Sciences. 2018;115(32):E7615-E7623. doi:10.1073/pnas.1804517115
apa: Garrido-Charad, F., Vega Zuniga, T. A., Gutiérrez-Ibáñez, C., Fernandez, P.,
López-Jury, L., González-Cabrera, C., … Marín, G. J. (2018). “Shepherd’s crook”
neurons drive and synchronize the enhancing and suppressive mechanisms of the
midbrain stimulus selection network. Proceedings of the National Academy of
Sciences. National Academy of Sciences. https://doi.org/10.1073/pnas.1804517115
chicago: Garrido-Charad, Florencia, Tomas A Vega Zuniga, Cristián Gutiérrez-Ibáñez,
Pedro Fernandez, Luciana López-Jury, Cristian González-Cabrera, Harvey J. Karten,
Harald Luksch, and Gonzalo J. Marín. ““Shepherd’s Crook” Neurons Drive and Synchronize
the Enhancing and Suppressive Mechanisms of the Midbrain Stimulus Selection Network.”
Proceedings of the National Academy of Sciences. National Academy of Sciences,
2018. https://doi.org/10.1073/pnas.1804517115.
ieee: F. Garrido-Charad et al., ““Shepherd’s crook” neurons drive and synchronize
the enhancing and suppressive mechanisms of the midbrain stimulus selection network,”
Proceedings of the National Academy of Sciences, vol. 115, no. 32. National
Academy of Sciences, pp. E7615–E7623, 2018.
ista: Garrido-Charad F, Vega Zuniga TA, Gutiérrez-Ibáñez C, Fernandez P, López-Jury
L, González-Cabrera C, Karten HJ, Luksch H, Marín GJ. 2018. “Shepherd’s crook”
neurons drive and synchronize the enhancing and suppressive mechanisms of the
midbrain stimulus selection network. Proceedings of the National Academy of Sciences.
115(32), E7615–E7623.
mla: Garrido-Charad, Florencia, et al. ““Shepherd’s Crook” Neurons Drive and Synchronize
the Enhancing and Suppressive Mechanisms of the Midbrain Stimulus Selection Network.”
Proceedings of the National Academy of Sciences, vol. 115, no. 32, National
Academy of Sciences, 2018, pp. E7615–23, doi:10.1073/pnas.1804517115.
short: F. Garrido-Charad, T.A. Vega Zuniga, C. Gutiérrez-Ibáñez, P. Fernandez, L.
López-Jury, C. González-Cabrera, H.J. Karten, H. Luksch, G.J. Marín, Proceedings
of the National Academy of Sciences 115 (2018) E7615–E7623.
date_created: 2019-02-14T14:33:34Z
date_published: 2018-08-07T00:00:00Z
date_updated: 2023-09-19T14:35:36Z
day: '07'
department:
- _id: MaJö
doi: 10.1073/pnas.1804517115
external_id:
isi:
- '000440982000020'
pmid:
- '30026198'
fulldoi: https://doi.org/10.1073/pnas.1804517115
intvolume: ' 115'
isi: 1
issue: '32'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pubmed/30026198
month: '08'
oa: 1
oa_version: Submitted Version
page: E7615-E7623
pmid: 1
publication: Proceedings of the National Academy of Sciences
publication_identifier:
eissn:
- 1091-6490
issn:
- 0027-8424
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: “Shepherd’s crook” neurons drive and synchronize the enhancing and suppressive
mechanisms of the midbrain stimulus selection network
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 115
year: '2018'
...
---
_id: '6011'
abstract:
- lang: eng
text: 'We establish a data-dependent notion of algorithmic stability for Stochastic
Gradient Descent (SGD), and employ it to develop novel generalization bounds.
This is in contrast to previous distribution-free algorithmic stability results
for SGD which depend on the worst-case constants. By virtue of the data-dependent
argument, our bounds provide new insights into learning with SGD on convex and
non-convex problems. In the convex case, we show that the bound on the generalization
error depends on the risk at the initialization point. In the non-convex case,
we prove that the expected curvature of the objective function around the initialization
point has crucial influence on the generalization error. In both cases, our results
suggest a simple data-driven strategy to stabilize SGD by pre-screening its initialization.
As a corollary, our results allow us to show optimistic generalization bounds
that exhibit fast convergence rates for SGD subject to a vanishing empirical risk
and low noise of stochastic gradient. '
article_processing_charge: No
arxiv: 1
author:
- first_name: Ilja
full_name: Kuzborskij, Ilja
last_name: Kuzborskij
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Kuzborskij I, Lampert C. Data-dependent stability of stochastic gradient descent.
In: Proceedings of the 35 Th International Conference on Machine Learning.
Vol 80. ML Research Press; 2018:2815-2824.'
apa: 'Kuzborskij, I., & Lampert, C. (2018). Data-dependent stability of stochastic
gradient descent. In Proceedings of the 35 th International Conference on Machine
Learning (Vol. 80, pp. 2815–2824). Stockholm, Sweden: ML Research Press.'
chicago: Kuzborskij, Ilja, and Christoph Lampert. “Data-Dependent Stability of Stochastic
Gradient Descent.” In Proceedings of the 35 Th International Conference on
Machine Learning, 80:2815–24. ML Research Press, 2018.
ieee: I. Kuzborskij and C. Lampert, “Data-dependent stability of stochastic gradient
descent,” in Proceedings of the 35 th International Conference on Machine Learning,
Stockholm, Sweden, 2018, vol. 80, pp. 2815–2824.
ista: 'Kuzborskij I, Lampert C. 2018. Data-dependent stability of stochastic gradient
descent. Proceedings of the 35 th International Conference on Machine Learning.
ICML: International Conference on Machine Learning vol. 80, 2815–2824.'
mla: Kuzborskij, Ilja, and Christoph Lampert. “Data-Dependent Stability of Stochastic
Gradient Descent.” Proceedings of the 35 Th International Conference on Machine
Learning, vol. 80, ML Research Press, 2018, pp. 2815–24.
short: I. Kuzborskij, C. Lampert, in:, Proceedings of the 35 Th International Conference
on Machine Learning, ML Research Press, 2018, pp. 2815–2824.
conference:
end_date: 2018-07-15
location: Stockholm, Sweden
name: 'ICML: International Conference on Machine Learning'
start_date: 2018-07-10
date_created: 2019-02-14T14:51:57Z
date_published: 2018-02-01T00:00:00Z
date_updated: 2025-04-15T07:10:23Z
day: '01'
department:
- _id: ChLa
ec_funded: 1
external_id:
arxiv:
- '1703.01678'
isi:
- '000683379202095'
intvolume: ' 80'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1703.01678
month: '02'
oa: 1
oa_version: Preprint
page: 2815-2824
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication: Proceedings of the 35 th International Conference on Machine Learning
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Data-dependent stability of stochastic gradient descent
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 80
year: '2018'
...
---
_id: '6012'
abstract:
- lang: eng
text: We present an approach to identify concise equations from data using a shallow
neural network approach. In contrast to ordinary black-box regression, this approach
allows understanding functional relations and generalizing them from observed
data to unseen parts of the parameter space. We show how to extend the class of
learnable equations for a recently proposed equation learning network to include
divisions, and we improve the learning and model selection strategy to be useful
for challenging real-world data. For systems governed by analytical expressions,
our method can in many cases identify the true underlying equation and extrapolate
to unseen domains. We demonstrate its effectiveness by experiments on a cart-pendulum
system, where only 2 random rollouts are required to learn the forward dynamics
and successfully achieve the swing-up task.
article_processing_charge: No
arxiv: 1
author:
- first_name: Subham
full_name: Sahoo, Subham
last_name: Sahoo
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
- first_name: Georg S
full_name: Martius, Georg S
id: 3A276B68-F248-11E8-B48F-1D18A9856A87
last_name: Martius
citation:
ama: 'Sahoo S, Lampert C, Martius GS. Learning equations for extrapolation and control.
In: Proceedings of the 35th International Conference on Machine Learning.
Vol 80. ML Research Press; 2018:4442-4450.'
apa: 'Sahoo, S., Lampert, C., & Martius, G. S. (2018). Learning equations for
extrapolation and control. In Proceedings of the 35th International Conference
on Machine Learning (Vol. 80, pp. 4442–4450). Stockholm, Sweden: ML Research
Press.'
chicago: Sahoo, Subham, Christoph Lampert, and Georg S Martius. “Learning Equations
for Extrapolation and Control.” In Proceedings of the 35th International Conference
on Machine Learning, 80:4442–50. ML Research Press, 2018.
ieee: S. Sahoo, C. Lampert, and G. S. Martius, “Learning equations for extrapolation
and control,” in Proceedings of the 35th International Conference on Machine
Learning, Stockholm, Sweden, 2018, vol. 80, pp. 4442–4450.
ista: 'Sahoo S, Lampert C, Martius GS. 2018. Learning equations for extrapolation
and control. Proceedings of the 35th International Conference on Machine Learning.
ICML: International Conference on Machine Learning vol. 80, 4442–4450.'
mla: Sahoo, Subham, et al. “Learning Equations for Extrapolation and Control.” Proceedings
of the 35th International Conference on Machine Learning, vol. 80, ML Research
Press, 2018, pp. 4442–50.
short: S. Sahoo, C. Lampert, G.S. Martius, in:, Proceedings of the 35th International
Conference on Machine Learning, ML Research Press, 2018, pp. 4442–4450.
conference:
end_date: 2018-07-15
location: Stockholm, Sweden
name: 'ICML: International Conference on Machine Learning'
start_date: 2018-07-10
date_created: 2019-02-14T15:21:07Z
date_published: 2018-02-01T00:00:00Z
date_updated: 2025-04-15T06:50:24Z
day: '01'
department:
- _id: ChLa
ec_funded: 1
external_id:
arxiv:
- '1806.07259'
isi:
- '000683379204058'
intvolume: ' 80'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1806.07259
month: '02'
oa: 1
oa_version: Preprint
page: 4442-4450
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Proceedings of the 35th International Conference on Machine Learning
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/first-machine-learning-method-capable-of-accurate-extrapolation/
scopus_import: '1'
status: public
title: Learning equations for extrapolation and control
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 80
year: '2018'
...
---
_id: '6031'
abstract:
- lang: eng
text: We introduce Clover, a new library for efficient computation using low-precision
data, providing mathematical routines required by fundamental methods in optimization
and sparse recovery. Our library faithfully implements variants of stochastic
quantization that guarantee convergence at low precision, and supports data formats
from 4-bit quantized to 32-bit IEEE-754 on current Intel processors. In particular,
we show that 4-bit can be implemented efficiently using Intel AVX despite the
lack of native support for this data format. Experimental results with dot product,
matrix-vector multiplication (MVM), gradient descent (GD), and iterative hard
thresholding (IHT) demonstrate that the attainable speedups are in many cases
close to linear with respect to the reduction of precision due to reduced data
movement. Finally, for GD and IHT, we show examples of absolute speedup achieved
by 4-bit versus 32-bit, by iterating until a given target error is achieved.
article_number: '8598402'
article_processing_charge: No
author:
- first_name: Alen
full_name: Stojanov, Alen
last_name: Stojanov
- first_name: Tyler Michael
full_name: Smith, Tyler Michael
last_name: Smith
- 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: Markus
full_name: Puschel, Markus
last_name: Puschel
citation:
ama: 'Stojanov A, Smith TM, Alistarh D-A, Puschel M. Fast quantized arithmetic on
x86: Trading compute for data movement. In: 2018 IEEE International Workshop
on Signal Processing Systems. Vol 2018-October. IEEE; 2018. doi:10.1109/SiPS.2018.8598402'
apa: 'Stojanov, A., Smith, T. M., Alistarh, D.-A., & Puschel, M. (2018). Fast
quantized arithmetic on x86: Trading compute for data movement. In 2018 IEEE
International Workshop on Signal Processing Systems (Vol. 2018–October). Cape
Town, South Africa: IEEE. https://doi.org/10.1109/SiPS.2018.8598402'
chicago: 'Stojanov, Alen, Tyler Michael Smith, Dan-Adrian Alistarh, and Markus Puschel.
“Fast Quantized Arithmetic on X86: Trading Compute for Data Movement.” In 2018
IEEE International Workshop on Signal Processing Systems, Vol. 2018–October.
IEEE, 2018. https://doi.org/10.1109/SiPS.2018.8598402.'
ieee: 'A. Stojanov, T. M. Smith, D.-A. Alistarh, and M. Puschel, “Fast quantized
arithmetic on x86: Trading compute for data movement,” in 2018 IEEE International
Workshop on Signal Processing Systems, Cape Town, South Africa, 2018, vol.
2018–October.'
ista: 'Stojanov A, Smith TM, Alistarh D-A, Puschel M. 2018. Fast quantized arithmetic
on x86: Trading compute for data movement. 2018 IEEE International Workshop on
Signal Processing Systems. SiPS: Workshop on Signal Processing Systems vol. 2018–October,
8598402.'
mla: 'Stojanov, Alen, et al. “Fast Quantized Arithmetic on X86: Trading Compute
for Data Movement.” 2018 IEEE International Workshop on Signal Processing Systems,
vol. 2018–October, 8598402, IEEE, 2018, doi:10.1109/SiPS.2018.8598402.'
short: A. Stojanov, T.M. Smith, D.-A. Alistarh, M. Puschel, in:, 2018 IEEE International
Workshop on Signal Processing Systems, IEEE, 2018.
conference:
end_date: 2018-10-24
location: Cape Town, South Africa
name: 'SiPS: Workshop on Signal Processing Systems'
start_date: 2018-10-21
date_created: 2019-02-17T22:59:25Z
date_published: 2018-12-31T00:00:00Z
date_updated: 2023-09-19T14:41:51Z
day: '31'
department:
- _id: DaAl
doi: 10.1109/SiPS.2018.8598402
external_id:
isi:
- '000465106800060'
fulldoi: https://doi.org/10.1109/SiPS.2018.8598402
isi: 1
language:
- iso: eng
month: '12'
oa_version: None
publication: 2018 IEEE International Workshop on Signal Processing Systems
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Fast quantized arithmetic on x86: Trading compute for data movement'
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2018-October
year: '2018'
...
---
_id: '6032'
abstract:
- lang: eng
text: The main result of this article is a generalization of the classical blossom
algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean
CSPs where each variable appears in exactly two constraints (we call it edge CSP)
and all constraints are even Δ-matroid relations (represented by lists of tuples).
As a consequence of this, we settle the complexity classification of planar Boolean
CSPs started by Dvorak and Kupec. Using a reduction to even Δ-matroids, we then
extend the tractability result to larger classes of Δ-matroids that we call efficiently
coverable. It properly includes classes that were known to be tractable before,
namely, co-independent, compact, local, linear, and binary, with the following
caveat:We represent Δ-matroids by lists of tuples, while the last two use a representation
by matrices. Since an n ×n matrix can represent exponentially many tuples, our
tractability result is not strictly stronger than the known algorithm for linear
and binary Δ-matroids.
article_number: '22'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Alexandr
full_name: Kazda, Alexandr
id: 3B32BAA8-F248-11E8-B48F-1D18A9856A87
last_name: Kazda
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Michal
full_name: Rolinek, Michal
id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
last_name: Rolinek
citation:
ama: Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of
planar boolean CSPs. ACM Transactions on Algorithms. 2018;15(2). doi:10.1145/3230649
apa: Kazda, A., Kolmogorov, V., & Rolinek, M. (2018). Even delta-matroids and
the complexity of planar boolean CSPs. ACM Transactions on Algorithms.
ACM. https://doi.org/10.1145/3230649
chicago: Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids
and the Complexity of Planar Boolean CSPs.” ACM Transactions on Algorithms.
ACM, 2018. https://doi.org/10.1145/3230649.
ieee: A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity
of planar boolean CSPs,” ACM Transactions on Algorithms, vol. 15, no. 2.
ACM, 2018.
ista: Kazda A, Kolmogorov V, Rolinek M. 2018. Even delta-matroids and the complexity
of planar boolean CSPs. ACM Transactions on Algorithms. 15(2), 22.
mla: Kazda, Alexandr, et al. “Even Delta-Matroids and the Complexity of Planar Boolean
CSPs.” ACM Transactions on Algorithms, vol. 15, no. 2, 22, ACM, 2018, doi:10.1145/3230649.
short: A. Kazda, V. Kolmogorov, M. Rolinek, ACM Transactions on Algorithms 15 (2018).
date_created: 2019-02-17T22:59:25Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2025-06-04T08:46:58Z
day: '01'
department:
- _id: VlKo
doi: 10.1145/3230649
ec_funded: 1
external_id:
arxiv:
- '1602.03124'
isi:
- '000468036500007'
fulldoi: https://doi.org/10.1145/3230649
intvolume: ' 15'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1602.03124
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: ACM Transactions on Algorithms
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
record:
- id: '1192'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Even delta-matroids and the complexity of planar boolean CSPs
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 15
year: '2018'
...
---
_id: '606'
abstract:
- lang: eng
text: We establish the existence of a global solution for a new family of fluid-like
equations, which are obtained in certain regimes in as the mean-field evolution
of the supercurrent density in a (2D section of a) type-II superconductor with
pinning and with imposed electric current. We also consider general vortex-sheet
initial data, and investigate the uniqueness and regularity properties of the
solution. For some choice of parameters, the equation under investigation coincides
with the so-called lake equation from 2D shallow water fluid dynamics, and our
analysis then leads to a new existence result for rough initial data.
acknowledgement: "The work of the author is supported by F.R.S.-FNRS ( Fonds de la
Recherche Scientifique - FNRS ) through a Research Fellowship.\r\n\r\n"
article_processing_charge: No
arxiv: 1
author:
- first_name: Mitia
full_name: Duerinckx, Mitia
last_name: Duerinckx
- first_name: Julian L
full_name: Fischer, Julian L
id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87
last_name: Fischer
orcid: 0000-0002-0479-558X
citation:
ama: Duerinckx M, Fischer JL. Well-posedness for mean-field evolutions arising in
superconductivity. Annales de l’Institut Henri Poincare (C) Non Linear Analysis.
2018;35(5):1267-1319. doi:10.1016/j.anihpc.2017.11.004
apa: Duerinckx, M., & Fischer, J. L. (2018). Well-posedness for mean-field evolutions
arising in superconductivity. Annales de l’Institut Henri Poincare (C) Non
Linear Analysis. Elsevier. https://doi.org/10.1016/j.anihpc.2017.11.004
chicago: Duerinckx, Mitia, and Julian L Fischer. “Well-Posedness for Mean-Field
Evolutions Arising in Superconductivity.” Annales de l’Institut Henri Poincare
(C) Non Linear Analysis. Elsevier, 2018. https://doi.org/10.1016/j.anihpc.2017.11.004.
ieee: M. Duerinckx and J. L. Fischer, “Well-posedness for mean-field evolutions
arising in superconductivity,” Annales de l’Institut Henri Poincare (C) Non
Linear Analysis, vol. 35, no. 5. Elsevier, pp. 1267–1319, 2018.
ista: Duerinckx M, Fischer JL. 2018. Well-posedness for mean-field evolutions arising
in superconductivity. Annales de l’Institut Henri Poincare (C) Non Linear Analysis.
35(5), 1267–1319.
mla: Duerinckx, Mitia, and Julian L. Fischer. “Well-Posedness for Mean-Field Evolutions
Arising in Superconductivity.” Annales de l’Institut Henri Poincare (C) Non
Linear Analysis, vol. 35, no. 5, Elsevier, 2018, pp. 1267–319, doi:10.1016/j.anihpc.2017.11.004.
short: M. Duerinckx, J.L. Fischer, Annales de l’Institut Henri Poincare (C) Non
Linear Analysis 35 (2018) 1267–1319.
date_created: 2018-12-11T11:47:27Z
date_published: 2018-08-01T00:00:00Z
date_updated: 2023-09-19T10:39:09Z
day: '01'
department:
- _id: JuFi
doi: 10.1016/j.anihpc.2017.11.004
external_id:
arxiv:
- '1607.00268'
isi:
- '000437975500005'
fulldoi: https://doi.org/10.1016/j.anihpc.2017.11.004
intvolume: ' 35'
isi: 1
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1607.00268
month: '08'
oa: 1
oa_version: Submitted Version
page: 1267-1319
publication: Annales de l'Institut Henri Poincare (C) Non Linear Analysis
publication_status: published
publisher: Elsevier
publist_id: '7199'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Well-posedness for mean-field evolutions arising in superconductivity
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 35
year: '2018'
...
---
_id: '607'
abstract:
- lang: eng
text: We study the Fokker-Planck equation derived in the large system limit of the
Markovian process describing the dynamics of quantitative traits. The Fokker-Planck
equation is posed on a bounded domain and its transport and diffusion coefficients
vanish on the domain's boundary. We first argue that, despite this degeneracy,
the standard no-flux boundary condition is valid. We derive the weak formulation
of the problem and prove the existence and uniqueness of its solutions by constructing
the corresponding contraction semigroup on a suitable function space. Then, we
prove that for the parameter regime with high enough mutation rate the problem
exhibits a positive spectral gap, which implies exponential convergence to equilibrium.Next,
we provide a simple derivation of the so-called Dynamic Maximum Entropy (DynMaxEnt)
method for approximation of observables (moments) of the Fokker-Planck solution,
which can be interpreted as a nonlinear Galerkin approximation. The limited applicability
of the DynMaxEnt method inspires us to introduce its modified version that is
valid for the whole range of admissible parameters. Finally, we present several
numerical experiments to demonstrate the performance of both the original and
modified DynMaxEnt methods. We observe that in the parameter regimes where both
methods are valid, the modified one exhibits slightly better approximation properties
compared to the original one.
acknowledgement: "JH and PM are funded by KAUST baseline funds and grant no. 1000000193
.\r\nWe thank Nicholas Barton (IST Austria) for his useful comments and suggestions.
\r\n\r\n"
article_processing_charge: No
arxiv: 1
author:
- first_name: Katarina
full_name: Bodova, Katarina
id: 2BA24EA0-F248-11E8-B48F-1D18A9856A87
last_name: Bodova
orcid: 0000-0002-7214-0171
- first_name: Jan
full_name: Haskovec, Jan
last_name: Haskovec
- first_name: Peter
full_name: Markowich, Peter
last_name: Markowich
citation:
ama: 'Bodova K, Haskovec J, Markowich P. Well posedness and maximum entropy approximation
for the dynamics of quantitative traits. Physica D: Nonlinear Phenomena.
2018;376-377:108-120. doi:10.1016/j.physd.2017.10.015'
apa: 'Bodova, K., Haskovec, J., & Markowich, P. (2018). Well posedness and maximum
entropy approximation for the dynamics of quantitative traits. Physica D: Nonlinear
Phenomena. Elsevier. https://doi.org/10.1016/j.physd.2017.10.015'
chicago: 'Bodova, Katarina, Jan Haskovec, and Peter Markowich. “Well Posedness and
Maximum Entropy Approximation for the Dynamics of Quantitative Traits.” Physica
D: Nonlinear Phenomena. Elsevier, 2018. https://doi.org/10.1016/j.physd.2017.10.015.'
ieee: 'K. Bodova, J. Haskovec, and P. Markowich, “Well posedness and maximum entropy
approximation for the dynamics of quantitative traits,” Physica D: Nonlinear
Phenomena, vol. 376–377. Elsevier, pp. 108–120, 2018.'
ista: 'Bodova K, Haskovec J, Markowich P. 2018. Well posedness and maximum entropy
approximation for the dynamics of quantitative traits. Physica D: Nonlinear Phenomena.
376–377, 108–120.'
mla: 'Bodova, Katarina, et al. “Well Posedness and Maximum Entropy Approximation
for the Dynamics of Quantitative Traits.” Physica D: Nonlinear Phenomena,
vol. 376–377, Elsevier, 2018, pp. 108–20, doi:10.1016/j.physd.2017.10.015.'
short: 'K. Bodova, J. Haskovec, P. Markowich, Physica D: Nonlinear Phenomena 376–377
(2018) 108–120.'
corr_author: '1'
date_created: 2018-12-11T11:47:28Z
date_published: 2018-08-01T00:00:00Z
date_updated: 2024-10-09T20:58:45Z
day: '01'
department:
- _id: NiBa
- _id: GaTk
doi: 10.1016/j.physd.2017.10.015
external_id:
arxiv:
- '1704.08757'
isi:
- '000437962900012'
fulldoi: https://doi.org/10.1016/j.physd.2017.10.015
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1704.08757
month: '08'
oa: 1
oa_version: Submitted Version
page: 108-120
publication: 'Physica D: Nonlinear Phenomena'
publication_status: published
publisher: Elsevier
publist_id: '7198'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Well posedness and maximum entropy approximation for the dynamics of quantitative
traits
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 376-377
year: '2018'
...
---
_id: '608'
abstract:
- lang: eng
text: Synthesis is the automated construction of a system from its specification.
In real life, hardware and software systems are rarely constructed from scratch.
Rather, a system is typically constructed from a library of components. Lustig
and Vardi formalized this intuition and studied LTL synthesis from component libraries.
In real life, designers seek optimal systems. In this paper we add optimality
considerations to the setting. We distinguish between quality considerations (for
example, size - the smaller a system is, the better it is), and pricing (for example,
the payment to the company who manufactured the component). We study the problem
of designing systems with minimal quality-cost and price. A key point is that
while the quality cost is individual - the choices of a designer are independent
of choices made by other designers that use the same library, pricing gives rise
to a resource-allocation game - designers that use the same component share its
price, with the share being proportional to the number of uses (a component can
be used several times in a design). We study both closed and open settings, and
in both we solve the problem of finding an optimal design. In a setting with multiple
designers, we also study the game-theoretic problems of the induced resource-allocation
game.
article_processing_charge: No
article_type: original
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: Avni G, Kupferman O. Synthesis from component libraries with costs. Theoretical
Computer Science. 2018;712:50-72. doi:10.1016/j.tcs.2017.11.001
apa: Avni, G., & Kupferman, O. (2018). Synthesis from component libraries with
costs. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2017.11.001
chicago: Avni, Guy, and Orna Kupferman. “Synthesis from Component Libraries with
Costs.” Theoretical Computer Science. Elsevier, 2018. https://doi.org/10.1016/j.tcs.2017.11.001.
ieee: G. Avni and O. Kupferman, “Synthesis from component libraries with costs,”
Theoretical Computer Science, vol. 712. Elsevier, pp. 50–72, 2018.
ista: Avni G, Kupferman O. 2018. Synthesis from component libraries with costs.
Theoretical Computer Science. 712, 50–72.
mla: Avni, Guy, and Orna Kupferman. “Synthesis from Component Libraries with Costs.”
Theoretical Computer Science, vol. 712, Elsevier, 2018, pp. 50–72, doi:10.1016/j.tcs.2017.11.001.
short: G. Avni, O. Kupferman, Theoretical Computer Science 712 (2018) 50–72.
corr_author: '1'
date_created: 2018-12-11T11:47:28Z
date_published: 2018-02-15T00:00:00Z
date_updated: 2026-06-18T18:58:53Z
day: '15'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1016/j.tcs.2017.11.001
ec_funded: 1
external_id:
isi:
- '000424959200003'
fulldoi: https://doi.org/10.1016/j.tcs.2017.11.001
intvolume: ' 712'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.636.4529
month: '02'
oa: 1
oa_version: Published Version
page: 50 - 72
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication: Theoretical Computer Science
publication_status: published
publisher: Elsevier
publist_id: '7197'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Synthesis from component libraries with costs
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 712
year: '2018'
...
---
_id: '61'
abstract:
- lang: eng
text: 'We prove that there is no strongly regular graph (SRG) with parameters (460;
153; 32; 60). The proof is based on a recent lower bound on the number of 4-cliques
in a SRG and some applications of Euclidean representation of SRGs. '
article_processing_charge: No
arxiv: 1
author:
- first_name: Andriy
full_name: Bondarenko, Andriy
last_name: Bondarenko
- first_name: Anton
full_name: Mellit, Anton
id: 388D3134-F248-11E8-B48F-1D18A9856A87
last_name: Mellit
- first_name: Andriy
full_name: Prymak, Andriy
last_name: Prymak
- first_name: Danylo
full_name: Radchenko, Danylo
last_name: Radchenko
- first_name: Maryna
full_name: Viazovska, Maryna
last_name: Viazovska
citation:
ama: 'Bondarenko A, Mellit A, Prymak A, Radchenko D, Viazovska M. There is no strongly
regular graph with parameters (460; 153; 32; 60). In: Contemporary Computational
Mathematics. Springer; 2018:131-134. doi:10.1007/978-3-319-72456-0_7'
apa: Bondarenko, A., Mellit, A., Prymak, A., Radchenko, D., & Viazovska, M.
(2018). There is no strongly regular graph with parameters (460; 153; 32; 60).
In Contemporary Computational Mathematics (pp. 131–134). Springer. https://doi.org/10.1007/978-3-319-72456-0_7
chicago: Bondarenko, Andriy, Anton Mellit, Andriy Prymak, Danylo Radchenko, and
Maryna Viazovska. “There Is No Strongly Regular Graph with Parameters (460; 153;
32; 60).” In Contemporary Computational Mathematics, 131–34. Springer,
2018. https://doi.org/10.1007/978-3-319-72456-0_7.
ieee: A. Bondarenko, A. Mellit, A. Prymak, D. Radchenko, and M. Viazovska, “There
is no strongly regular graph with parameters (460; 153; 32; 60),” in Contemporary
Computational Mathematics, Springer, 2018, pp. 131–134.
ista: 'Bondarenko A, Mellit A, Prymak A, Radchenko D, Viazovska M. 2018.There is
no strongly regular graph with parameters (460; 153; 32; 60). In: Contemporary
Computational Mathematics. , 131–134.'
mla: Bondarenko, Andriy, et al. “There Is No Strongly Regular Graph with Parameters
(460; 153; 32; 60).” Contemporary Computational Mathematics, Springer,
2018, pp. 131–34, doi:10.1007/978-3-319-72456-0_7.
short: A. Bondarenko, A. Mellit, A. Prymak, D. Radchenko, M. Viazovska, in:, Contemporary
Computational Mathematics, Springer, 2018, pp. 131–134.
date_created: 2018-12-11T11:44:25Z
date_published: 2018-05-23T00:00:00Z
date_updated: 2021-01-12T08:06:06Z
day: '23'
department:
- _id: TaHa
doi: 10.1007/978-3-319-72456-0_7
extern: '1'
external_id:
arxiv:
- '1509.06286'
fulldoi: https://doi.org/10.1007/978-3-319-72456-0_7
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1509.06286
month: '05'
oa: 1
oa_version: Preprint
page: 131 - 134
publication: Contemporary Computational Mathematics
publication_status: published
publisher: Springer
publist_id: '7993'
quality_controlled: '1'
status: public
title: There is no strongly regular graph with parameters (460; 153; 32; 60)
type: book_chapter
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2018'
...