---
_id: '9455'
abstract:
- lang: eng
text: Proteins of the ARGONAUTE family are important in diverse posttranscriptional
RNA-mediated gene-silencing systems as well as in transcriptional gene silencing
in Drosophila and fission yeast and in programmed DNA elimination in Tetrahymena.
We cloned ARGONAUTE4 (AGO4) from a screen for mutants that suppress silencing
of the Arabidopsis SUPERMAN(SUP) gene. The ago4-1 mutant reactivated silentSUP
alleles and decreased CpNpG and asymmetric DNA methylation as well as histone
H3 lysine-9 methylation. In addition,ago4-1 blocked histone and DNA methylation
and the accumulation of 25-nucleotide small interfering RNAs (siRNAs) that correspond
to the retroelement AtSN1. These results suggest that AGO4 and long siRNAs direct
chromatin modifications, including histone methylation and non-CpG DNA methylation.
article_processing_charge: No
article_type: original
author:
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
- first_name: ' Xiaofeng'
full_name: Cao, Xiaofeng
last_name: Cao
- first_name: Steven E.
full_name: Jacobsen, Steven E.
last_name: Jacobsen
citation:
ama: Zilberman D, Cao Xiaofeng, Jacobsen SE. ARGONAUTE4 control of locus-specific
siRNA accumulation and DNA and histone methylation. Science. 2003;299(5607):716-719.
doi:10.1126/science.1079695
apa: Zilberman, D., Cao, Xiaofeng, & Jacobsen, S. E. (2003). ARGONAUTE4 control
of locus-specific siRNA accumulation and DNA and histone methylation. Science.
American Association for the Advancement of Science. https://doi.org/10.1126/science.1079695
chicago: Zilberman, Daniel, Xiaofeng Cao, and Steven E. Jacobsen. “ARGONAUTE4 Control
of Locus-Specific SiRNA Accumulation and DNA and Histone Methylation.” Science.
American Association for the Advancement of Science, 2003. https://doi.org/10.1126/science.1079695.
ieee: D. Zilberman, Xiaofeng Cao, and S. E. Jacobsen, “ARGONAUTE4 control of locus-specific
siRNA accumulation and DNA and histone methylation,” Science, vol. 299,
no. 5607. American Association for the Advancement of Science, pp. 716–719, 2003.
ista: Zilberman D, Cao Xiaofeng, Jacobsen SE. 2003. ARGONAUTE4 control of locus-specific
siRNA accumulation and DNA and histone methylation. Science. 299(5607), 716–719.
mla: Zilberman, Daniel, et al. “ARGONAUTE4 Control of Locus-Specific SiRNA Accumulation
and DNA and Histone Methylation.” Science, vol. 299, no. 5607, American
Association for the Advancement of Science, 2003, pp. 716–19, doi:10.1126/science.1079695.
short: D. Zilberman, Xiaofeng Cao, S.E. Jacobsen, Science 299 (2003) 716–719.
date_created: 2021-06-04T11:26:26Z
date_published: 2003-01-31T00:00:00Z
date_updated: 2021-12-14T08:43:30Z
day: '31'
department:
- _id: DaZi
doi: 10.1126/science.1079695
extern: '1'
external_id:
pmid:
- '12522258'
intvolume: ' 299'
issue: '5607'
keyword:
- Multidisciplinary
language:
- iso: eng
month: '01'
oa_version: None
page: 716-719
pmid: 1
publication: Science
publication_identifier:
eissn:
- 1095-9203
issn:
- 0036-8075
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: ARGONAUTE4 control of locus-specific siRNA accumulation and DNA and histone
methylation
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 299
year: '2003'
...
---
_id: '4628'
abstract:
- lang: eng
text: 'Discounting the future means that the value, today, of a unit payoffis 1
if the payoffo ccurs today, a if it occurs tomorrow, a 2 if it occurs the day
after tomorrow, and so on, for some real-valued discount factor 0 < a <
1. Discounting (or inflation) is a key paradigm in economics and has been studied
in Markov decision processes as well as game theory. We submit that discounting
also has a natural place in systems engineering: for nonterminating systems, a
potential bug in the far-away future is less troubling than a potential bug today.
We therefore develop a systems theory with discounting. Our theory includes several
basic elements: discounted versions of system properties that correspond to the
ω-regular properties, fixpoint-based algorithms for checking discounted properties,
and a quantitative notion of bisimilarity for capturing the difference between
two states with respect to discounted properties. We present the theory in a general
form that applies to probabilistic systems as well as multicomponent systems (games),
but it readily specializes to classical transition systems. We show that discounting,
besides its natural practical appeal, has also several mathematical benefits.
First, the resulting theory is robust, in that small perturbations of a system
can cause only small changes in the properties of the system. Second, the theory
is computational, in that the values of discounted properties, as well as the
discounted bisimilarity distance between states, can be computed to any desired
degree of precision.'
acknowledgement: This research was supported in part by the NSF CAREER award CCR-0132780,
the DARPA grant F33615-C-98-3614, the NSF grants CCR-9988172, CCR-0234690 and CCR-0225610,
and the ONR grant N00014-02-1-0671.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Luca
full_name: De Alfaro, Luca
last_name: De Alfaro
- 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: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
citation:
ama: 'De Alfaro L, Henzinger TA, Majumdar R. Discounting the future in systems theory.
In: Proceedings of the 30th International Colloquium on Automata, Languages
and Programming. Vol 2719. Springer; 2003:1022-1037. doi:10.1007/3-540-45061-0_79'
apa: 'De Alfaro, L., Henzinger, T. A., & Majumdar, R. (2003). Discounting the
future in systems theory. In Proceedings of the 30th International Colloquium
on Automata, Languages and Programming (Vol. 2719, pp. 1022–1037). Eindhoven,
The Netherlands: Springer. https://doi.org/10.1007/3-540-45061-0_79'
chicago: De Alfaro, Luca, Thomas A Henzinger, and Ritankar Majumdar. “Discounting
the Future in Systems Theory.” In Proceedings of the 30th International Colloquium
on Automata, Languages and Programming, 2719:1022–37. Springer, 2003. https://doi.org/10.1007/3-540-45061-0_79.
ieee: L. De Alfaro, T. A. Henzinger, and R. Majumdar, “Discounting the future in
systems theory,” in Proceedings of the 30th International Colloquium on Automata,
Languages and Programming, Eindhoven, The Netherlands, 2003, vol. 2719, pp.
1022–1037.
ista: 'De Alfaro L, Henzinger TA, Majumdar R. 2003. Discounting the future in systems
theory. Proceedings of the 30th International Colloquium on Automata, Languages
and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 2719,
1022–1037.'
mla: De Alfaro, Luca, et al. “Discounting the Future in Systems Theory.” Proceedings
of the 30th International Colloquium on Automata, Languages and Programming,
vol. 2719, Springer, 2003, pp. 1022–37, doi:10.1007/3-540-45061-0_79.
short: L. De Alfaro, T.A. Henzinger, R. Majumdar, in:, Proceedings of the 30th International
Colloquium on Automata, Languages and Programming, Springer, 2003, pp. 1022–1037.
conference:
end_date: 2003-07-04
location: Eindhoven, The Netherlands
name: 'ICALP: Automata, Languages and Programming'
start_date: 2003-06-30
date_created: 2018-12-11T12:09:50Z
date_published: 2003-06-25T00:00:00Z
date_updated: 2023-07-26T13:07:31Z
day: '25'
doi: 10.1007/3-540-45061-0_79
extern: '1'
intvolume: ' 2719'
language:
- iso: eng
month: '06'
oa_version: None
page: 1022 - 1037
publication: Proceedings of the 30th International Colloquium on Automata, Languages
and Programming
publication_identifier:
isbn:
- '9783540404934'
publication_status: published
publisher: Springer
publist_id: '77'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Discounting the future in systems theory
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2719
year: '2003'
...
---
_id: '13436'
abstract:
- lang: eng
text: Cross-metathesis reactions of α,β-unsaturated sulfones and sulfoxides in the
presence of molybdenum and ruthenium pre-catalysts were tested. A selective metahesis
reaction was achieved between functionalized terminal olefins and vinyl sulfones
by using the ‘second generation’ ruthenium catalysts 1c–h while the highly active
Schrock catalyst 1b was found to be functional group incompatible with vinyl sulfones.
The cross-metathesis products were isolated in good yields with an excellent (E)-selectivity.
Both the molybdenum and ruthenium-based complexes were, however, incompatible
with α,β- and β,γ-unsaturated sulfoxides.
article_processing_charge: No
article_type: original
author:
- first_name: Anna
full_name: Michrowska, Anna
last_name: Michrowska
- first_name: Michał
full_name: Bieniek, Michał
last_name: Bieniek
- first_name: Mikhail
full_name: Kim, Mikhail
last_name: Kim
- first_name: Rafal
full_name: Klajn, Rafal
id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b
last_name: Klajn
- first_name: Karol
full_name: Grela, Karol
last_name: Grela
citation:
ama: Michrowska A, Bieniek M, Kim M, Klajn R, Grela K. Cross-metathesis reaction
of vinyl sulfones and sulfoxides. Tetrahedron. 2003;59(25):4525-4531. doi:10.1016/s0040-4020(03)00682-3
apa: Michrowska, A., Bieniek, M., Kim, M., Klajn, R., & Grela, K. (2003). Cross-metathesis
reaction of vinyl sulfones and sulfoxides. Tetrahedron. Elsevier. https://doi.org/10.1016/s0040-4020(03)00682-3
chicago: Michrowska, Anna, Michał Bieniek, Mikhail Kim, Rafal Klajn, and Karol Grela.
“Cross-Metathesis Reaction of Vinyl Sulfones and Sulfoxides.” Tetrahedron.
Elsevier, 2003. https://doi.org/10.1016/s0040-4020(03)00682-3.
ieee: A. Michrowska, M. Bieniek, M. Kim, R. Klajn, and K. Grela, “Cross-metathesis
reaction of vinyl sulfones and sulfoxides,” Tetrahedron, vol. 59, no. 25.
Elsevier, pp. 4525–4531, 2003.
ista: Michrowska A, Bieniek M, Kim M, Klajn R, Grela K. 2003. Cross-metathesis reaction
of vinyl sulfones and sulfoxides. Tetrahedron. 59(25), 4525–4531.
mla: Michrowska, Anna, et al. “Cross-Metathesis Reaction of Vinyl Sulfones and Sulfoxides.”
Tetrahedron, vol. 59, no. 25, Elsevier, 2003, pp. 4525–31, doi:10.1016/s0040-4020(03)00682-3.
short: A. Michrowska, M. Bieniek, M. Kim, R. Klajn, K. Grela, Tetrahedron 59 (2003)
4525–4531.
date_created: 2023-08-01T10:39:34Z
date_published: 2003-06-16T00:00:00Z
date_updated: 2023-08-08T12:44:17Z
day: '16'
doi: 10.1016/s0040-4020(03)00682-3
extern: '1'
intvolume: ' 59'
issue: '25'
keyword:
- Organic Chemistry
- Drug Discovery
- Biochemistry
language:
- iso: eng
month: '06'
oa_version: None
page: 4525-4531
publication: Tetrahedron
publication_identifier:
eissn:
- 1464-5416
issn:
- 0040-4020
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Cross-metathesis reaction of vinyl sulfones and sulfoxides
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 59
year: '2003'
...
---
_id: '4561'
abstract:
- lang: eng
text: 'We present a formalism for specifying component interfaces that expose component
requirements on limited resources. The formalism permits an algorithmic check
if two or more components, when put together, exceed the available resources.
Moreover, the formalism can be used to compute the quantity of resources necessary
for satisfying the requirements of a collection of components. The formalism can
be instantiated in several ways. For example, several components may draw power
from the same source. Then, the formalism supports compatibility checks such as:
can two components, when put together, achieve their tasks without ever exceeding
the available amount of peak power? or, can they achieve their tasks by using
no more than the initially available amount of energy (i.e., power accumulated
over time)? The corresponding quantitative questions that our algorithms answer
are the following: what is the amount of peak power needed for two components
to be put together? what is the corresponding amount of initial energy? To solve
these questions, we model interfaces with resource requirements as games with
quantitative objectives. The games are played on state spaces where each state
is labeled by a number (representing, e.g., power consumption), and a play produces
an infinite path of labels. The objective may be, for example, to minimize the
largest label that occurs during a play. We illustrate our approach by modeling
compatibility questions for the components of robot control software, and of wireless
sensor networks.'
acknowledgement: This research was supported in part by the DARPA grant F33615-00-C-1693,
the MARCO grant 98-DT-660, the ONR grant N00014-02-1-0671, and the NSF grants CCR-0085949,
CCR-0132780, CCR-0234690, and CCR-9988172.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Arindam
full_name: Chakrabarti, Arindam
last_name: Chakrabarti
- first_name: Luca
full_name: De Alfaro, Luca
last_name: De Alfaro
- 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: Mariëlle
full_name: Stoelinga, Mariëlle
last_name: Stoelinga
citation:
ama: 'Chakrabarti A, De Alfaro L, Henzinger TA, Stoelinga M. Resource interfaces.
In: Third International Conference on Embedded Software. Vol 2855. ACM;
2003:117-133. doi:10.1007/978-3-540-45212-6_9'
apa: 'Chakrabarti, A., De Alfaro, L., Henzinger, T. A., & Stoelinga, M. (2003).
Resource interfaces. In Third International Conference on Embedded Software
(Vol. 2855, pp. 117–133). Philadelphia, PA, USA: ACM. https://doi.org/10.1007/978-3-540-45212-6_9'
chicago: Chakrabarti, Arindam, Luca De Alfaro, Thomas A Henzinger, and Mariëlle
Stoelinga. “Resource Interfaces.” In Third International Conference on Embedded
Software, 2855:117–33. ACM, 2003. https://doi.org/10.1007/978-3-540-45212-6_9.
ieee: A. Chakrabarti, L. De Alfaro, T. A. Henzinger, and M. Stoelinga, “Resource
interfaces,” in Third International Conference on Embedded Software, Philadelphia,
PA, USA, 2003, vol. 2855, pp. 117–133.
ista: 'Chakrabarti A, De Alfaro L, Henzinger TA, Stoelinga M. 2003. Resource interfaces.
Third International Conference on Embedded Software. EMSOFT: Embedded Software
, LNCS, vol. 2855, 117–133.'
mla: Chakrabarti, Arindam, et al. “Resource Interfaces.” Third International
Conference on Embedded Software, vol. 2855, ACM, 2003, pp. 117–33, doi:10.1007/978-3-540-45212-6_9.
short: A. Chakrabarti, L. De Alfaro, T.A. Henzinger, M. Stoelinga, in:, Third International
Conference on Embedded Software, ACM, 2003, pp. 117–133.
conference:
end_date: 2003-10-15
location: Philadelphia, PA, USA
name: 'EMSOFT: Embedded Software '
start_date: 2003-10-13
date_created: 2018-12-11T12:09:29Z
date_published: 2003-09-29T00:00:00Z
date_updated: 2024-01-08T10:48:11Z
day: '29'
doi: 10.1007/978-3-540-45212-6_9
extern: '1'
intvolume: ' 2855'
language:
- iso: eng
month: '09'
oa_version: None
page: 117 - 133
publication: Third International Conference on Embedded Software
publication_identifier:
isbn:
- '9783540202233'
publication_status: published
publisher: ACM
publist_id: '148'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Resource interfaces
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2855
year: '2003'
...
---
_id: '4630'
abstract:
- lang: eng
text: We consider concurrent two-person games played in real time, in which the
players decide both which action to play, and when to play it. Such timed games
differ from untimed games in two essential ways. First, players can take each
other by surprise, because actions are played with delays that cannot be anticipated
by the opponent. Second, a player should not be able to win the game by preventing
time from diverging. We present a model of timed games that preserves the element
of surprise and accounts for time divergence in a way that treats both players
symmetrically and applies to all ω-regular winning conditions. We prove that the
ability to take each other by surprise adds extra power to the players. For the
case that the games are specified in the style of timed automata, we provide symbolic
algorithms for their solution with respect to all ω-regular winning conditions.
We also show that for these timed games, memory strategies are more powerful than
memoryless strategies already in the case of reachability objectives.
acknowledgement: Supported in part by the AFOSR MURI grant F49620-00-1-0327, the DARPA
grant F33615-C-98-3614, the MARCO grant 98-DT-660, -the ONR grant N00014-02-1-0671,
the NSF grants CCR-9988172, CCR-0225610, and CCR-0234690, the NSF CAREER award CCR-0132780,
and the MIUR grant MEFISTO.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Luca
full_name: De Alfaro, Luca
last_name: De Alfaro
- first_name: Marco
full_name: Faella, Marco
last_name: Faella
- 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: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
- first_name: Mariëlle
full_name: Stoelinga, Mariëlle
last_name: Stoelinga
citation:
ama: 'De Alfaro L, Faella M, Henzinger TA, Majumdar R, Stoelinga M. The element
of surprise in timed games. In: Proceedings of the 14th International Conference
on Concurrency Theory. Vol 2761. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2003:144-158. doi:10.1007/978-3-540-45187-7_9'
apa: 'De Alfaro, L., Faella, M., Henzinger, T. A., Majumdar, R., & Stoelinga,
M. (2003). The element of surprise in timed games. In Proceedings of the 14th
International Conference on Concurrency Theory (Vol. 2761, pp. 144–158). Marseille,
France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-45187-7_9'
chicago: De Alfaro, Luca, Marco Faella, Thomas A Henzinger, Ritankar Majumdar, and
Mariëlle Stoelinga. “The Element of Surprise in Timed Games.” In Proceedings
of the 14th International Conference on Concurrency Theory, 2761:144–58. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2003. https://doi.org/10.1007/978-3-540-45187-7_9.
ieee: L. De Alfaro, M. Faella, T. A. Henzinger, R. Majumdar, and M. Stoelinga, “The
element of surprise in timed games,” in Proceedings of the 14th International
Conference on Concurrency Theory, Marseille, France, 2003, vol. 2761, pp.
144–158.
ista: 'De Alfaro L, Faella M, Henzinger TA, Majumdar R, Stoelinga M. 2003. The element
of surprise in timed games. Proceedings of the 14th International Conference on
Concurrency Theory. CONCUR: Concurrency Theory, LNCS, vol. 2761, 144–158.'
mla: De Alfaro, Luca, et al. “The Element of Surprise in Timed Games.” Proceedings
of the 14th International Conference on Concurrency Theory, vol. 2761, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2003, pp. 144–58, doi:10.1007/978-3-540-45187-7_9.
short: L. De Alfaro, M. Faella, T.A. Henzinger, R. Majumdar, M. Stoelinga, in:,
Proceedings of the 14th International Conference on Concurrency Theory, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2003, pp. 144–158.
conference:
end_date: 2003-09-05
location: Marseille, France
name: 'CONCUR: Concurrency Theory'
start_date: 2003-09-03
date_created: 2018-12-11T12:09:51Z
date_published: 2003-08-21T00:00:00Z
date_updated: 2024-01-08T10:05:30Z
day: '21'
doi: 10.1007/978-3-540-45187-7_9
extern: '1'
intvolume: ' 2761'
language:
- iso: eng
month: '08'
oa_version: None
page: 144 - 158
publication: Proceedings of the 14th International Conference on Concurrency Theory
publication_identifier:
isbn:
- '9783540407539'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '78'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The element of surprise in timed games
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2761
year: '2003'
...