---
_id: '4623'
abstract:
- lang: eng
text: We classify component-based models of computation into component models and
interface models. A component model specifies for each component howthe component
behaves in an arbitrary environment; an interface model specifies for each component
what the component expects from the environment. Component models support compositional
abstraction, and therefore component-based verification. Interface models support
compositional refinement, and therefore componentbased design. Many aspects of
interface models, such as compatibility and refinement checking between interfaces,
are properly viewed in a gametheoretic setting, where the input and output values
of an interface are chosen by different players.
acknowledgement: This research was supported in part by the AFOSR MURI grant F49620-00-1-0327,
the DARPA ITO grant F33615-00-C-1693, the MARCO grant 98-DT-660, and the NSF ITR
grant CCR-0085949.
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
citation:
ama: 'De Alfaro L, Henzinger TA. Interface theories for component-based design.
In: Proceedings of the 1st International Workshop on Embedded Software.
Vol 2211. ACM; 2001:148-165. doi:10.1007/3-540-45449-7_11'
apa: 'De Alfaro, L., & Henzinger, T. A. (2001). Interface theories for component-based
design. In Proceedings of the 1st International Workshop on Embedded Software
(Vol. 2211, pp. 148–165). Tahoe City, CA, USA: ACM. https://doi.org/10.1007/3-540-45449-7_11'
chicago: De Alfaro, Luca, and Thomas A Henzinger. “Interface Theories for Component-Based
Design.” In Proceedings of the 1st International Workshop on Embedded Software,
2211:148–65. ACM, 2001. https://doi.org/10.1007/3-540-45449-7_11.
ieee: L. De Alfaro and T. A. Henzinger, “Interface theories for component-based
design,” in Proceedings of the 1st International Workshop on Embedded Software,
Tahoe City, CA, USA, 2001, vol. 2211, pp. 148–165.
ista: 'De Alfaro L, Henzinger TA. 2001. Interface theories for component-based design.
Proceedings of the 1st International Workshop on Embedded Software. EMSOFT: Embedded
Software , LNCS, vol. 2211, 148–165.'
mla: De Alfaro, Luca, and Thomas A. Henzinger. “Interface Theories for Component-Based
Design.” Proceedings of the 1st International Workshop on Embedded Software,
vol. 2211, ACM, 2001, pp. 148–65, doi:10.1007/3-540-45449-7_11.
short: L. De Alfaro, T.A. Henzinger, in:, Proceedings of the 1st International Workshop
on Embedded Software, ACM, 2001, pp. 148–165.
conference:
end_date: 2001-10-10
location: Tahoe City, CA, USA
name: 'EMSOFT: Embedded Software '
start_date: 2001-10-08
date_created: 2018-12-11T12:09:48Z
date_published: 2001-09-26T00:00:00Z
date_updated: 2023-05-08T12:11:20Z
day: '26'
doi: 10.1007/3-540-45449-7_11
extern: '1'
intvolume: ' 2211'
language:
- iso: eng
month: '09'
oa_version: None
page: 148 - 165
publication: Proceedings of the 1st International Workshop on Embedded Software
publication_identifier:
isbn:
- '9783540426738'
publication_status: published
publisher: ACM
publist_id: '84'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Interface theories for component-based design
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2211
year: '2001'
...
---
_id: '4632'
abstract:
- lang: eng
text: We present a compositional trace-based model for probabilistic systems. The
behavior of a system with probabilistic choice is a stochastic process, namely,
a probability distribution on traces, or “bundle.” Consequently, the semantics
of a system with both nondeterministic and probabilistic choice is a set of bundles.
The bundles of a composite system can be obtained by combining the bundles of
the components in a simple mathematical way. Refinement between systems is bundle
containment. We achieve assume-guarantee compositionality for bundle semantics
by introducing two scoping mechanisms. The first mechanism, which is standard
in compositional modeling, distinguishes inputs from outputs and hidden state.
The second mechanism, which arises in probabilistic systems, partitions the state
into probabilistically independent regions.
acknowledgement: This research was supported in part by the SRC contract 99-TJ-683.003,
the AFOSR MURI grant F49620-00-1-0327, the MARCO GSRC grant 98-DT-660, the NSF Theory
grant CCR-9988172, and the DARPA SEC grant F33615-C-98-3614.
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: Ranjit
full_name: Jhala, Ranjit
last_name: Jhala
citation:
ama: 'De Alfaro L, Henzinger TA, Jhala R. Compositional methods for probabilistic
systems. In: Proceedings of the 12th International Conference on on Concurrency
Theory. Vol 2154. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2001:351-365.
doi:10.1007/3-540-44685-0_24'
apa: 'De Alfaro, L., Henzinger, T. A., & Jhala, R. (2001). Compositional methods
for probabilistic systems. In Proceedings of the 12th International Conference
on on Concurrency Theory (Vol. 2154, pp. 351–365). Aalborg, Denmark: Schloss
Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/3-540-44685-0_24'
chicago: De Alfaro, Luca, Thomas A Henzinger, and Ranjit Jhala. “Compositional Methods
for Probabilistic Systems.” In Proceedings of the 12th International Conference
on on Concurrency Theory, 2154:351–65. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2001. https://doi.org/10.1007/3-540-44685-0_24.
ieee: L. De Alfaro, T. A. Henzinger, and R. Jhala, “Compositional methods for probabilistic
systems,” in Proceedings of the 12th International Conference on on Concurrency
Theory, Aalborg, Denmark, 2001, vol. 2154, pp. 351–365.
ista: 'De Alfaro L, Henzinger TA, Jhala R. 2001. Compositional methods for probabilistic
systems. Proceedings of the 12th International Conference on on Concurrency Theory.
CONCUR: Concurrency Theory, LNCS, vol. 2154, 351–365.'
mla: De Alfaro, Luca, et al. “Compositional Methods for Probabilistic Systems.”
Proceedings of the 12th International Conference on on Concurrency Theory,
vol. 2154, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2001, pp. 351–65,
doi:10.1007/3-540-44685-0_24.
short: L. De Alfaro, T.A. Henzinger, R. Jhala, in:, Proceedings of the 12th International
Conference on on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2001, pp. 351–365.
conference:
end_date: 2001-08-25
location: Aalborg, Denmark
name: 'CONCUR: Concurrency Theory'
start_date: 2001-08-20
date_created: 2018-12-11T12:09:51Z
date_published: 2001-08-13T00:00:00Z
date_updated: 2023-05-08T10:24:59Z
day: '13'
doi: 10.1007/3-540-44685-0_24
extern: '1'
intvolume: ' 2154'
language:
- iso: eng
month: '08'
oa_version: None
page: 351 - 365
publication: Proceedings of the 12th International Conference on on Concurrency Theory
publication_identifier:
isbn:
- '9783540424970'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '75'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Compositional methods for probabilistic systems
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2154
year: '2001'
...
---
_id: '4633'
abstract:
- lang: eng
text: "A procedure for the analysis of state spaces is called symbolic if it manipulates
not individual states, but sets of states that are represented by constraints.
Such a procedure can be used for the analysis of infinite state spaces, provided
termination is guaranteed. We present symbolic procedures, and corresponding termination
criteria, for the solution of infinite-state games, which occur in the control
and modular verification of infinite-state systems. To characterize the termination
of symbolic procedures for solving infinite-state games, we classify these game
structures into four increasingly restrictive categories:\r\n1 \tClass 1 consists
of infinite-state structures for which all safety and reachability games can be
solved.\r\n2 \tClass 2 consists of infinite-state structures for which all ω-regular
games can be solved.\r\n3 \tClass 3 consists of infinite-state structures for
which all nested positive boolean combinations of ω-regular games can be solved.\r\n4
\ \tClass 4 consists of infinite-state structures for which all nested boolean
combinations of ω-regular games can be solved.\r\nWe give a structural characterization
for each class, using equivalence relations on the state spaces of games which
range from game versions of trace equivalence to a game version of bisimilarity.
We provide infinite-state examples for all four classes of games from control
problems for hybrid systems. We conclude by presenting symbolic algorithms for
the synthesis of winning strategies (“controller synthesis”) for infinitestate
games with arbitrary ω-regular objectives, and prove termination over all class-2
structures. This settles, in particular, the symbolic controller synthesis problem
for rectangular hybrid systems."
acknowledgement: This research was supported in part by the AFOSR MURI grant F49620-00-1-0327,
the DARPA SEC grant F33615-C-98-3614, the MARCO GSRC grant 98-DT-660, the NSF Theory
grant CCR-9988172, and the NSF ITR grant CCR-0085949.
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. Symbolic algorithms for infinite-state
games. In: Proceedings of the 12th International Conference on on Concurrency
Theory. Vol 2154. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2001:536-550.
doi:10.1007/3-540-44685-0_36'
apa: 'De Alfaro, L., Henzinger, T. A., & Majumdar, R. (2001). Symbolic algorithms
for infinite-state games. In Proceedings of the 12th International Conference
on on Concurrency Theory (Vol. 2154, pp. 536–550). Aalborg, Denmark: Schloss
Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/3-540-44685-0_36'
chicago: De Alfaro, Luca, Thomas A Henzinger, and Ritankar Majumdar. “Symbolic Algorithms
for Infinite-State Games.” In Proceedings of the 12th International Conference
on on Concurrency Theory, 2154:536–50. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2001. https://doi.org/10.1007/3-540-44685-0_36.
ieee: L. De Alfaro, T. A. Henzinger, and R. Majumdar, “Symbolic algorithms for infinite-state
games,” in Proceedings of the 12th International Conference on on Concurrency
Theory, Aalborg, Denmark, 2001, vol. 2154, pp. 536–550.
ista: 'De Alfaro L, Henzinger TA, Majumdar R. 2001. Symbolic algorithms for infinite-state
games. Proceedings of the 12th International Conference on on Concurrency Theory.
CONCUR: Concurrency Theory, LNCS, vol. 2154, 536–550.'
mla: De Alfaro, Luca, et al. “Symbolic Algorithms for Infinite-State Games.” Proceedings
of the 12th International Conference on on Concurrency Theory, vol. 2154,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2001, pp. 536–50, doi:10.1007/3-540-44685-0_36.
short: L. De Alfaro, T.A. Henzinger, R. Majumdar, in:, Proceedings of the 12th International
Conference on on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2001, pp. 536–550.
conference:
end_date: 2001-08-25
location: Aalborg, Denmark
name: 'CONCUR: Concurrency Theory'
start_date: 2001-08-20
date_created: 2018-12-11T12:09:52Z
date_published: 2001-08-13T00:00:00Z
date_updated: 2023-05-08T09:57:31Z
day: '13'
doi: 10.1007/3-540-44685-0_36
extern: '1'
intvolume: ' 2154'
language:
- iso: eng
month: '08'
oa_version: None
page: 536 - 550
publication: Proceedings of the 12th International Conference on on Concurrency Theory
publication_identifier:
isbn:
- '9783540424970'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '73'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Symbolic algorithms for infinite-state games
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2154
year: '2001'
...
---
_id: '4634'
abstract:
- lang: eng
text: "A controller is an environment for a system that achieves a particular control
objective by providing inputs to the system without constraining the choices of
the system. For synchronous systems, where system and controller make simultaneous
and interdependent choices, the notion that a controller must not constrain the
choices of the system can be formalized by type systems for composability. In
a previous paper, we solved the control problem for static and dynamic types:
a static type is a dependency relation between inputs and outputs, and composition
is well-typed if it does not introduce cyclic dependencies; a dynamic type is
a set of static types, one for each state. Static and dynamic types, however,
cannot capture many important digital circuits, such as gated clocks, bidirectional
buses, and random-access memory. We therefore introduce more general type systems,
so-called dependent and bidirectional types, for modeling these situations, and
we solve the corresponding control problems.\r\nIn a system with a dependent type,
the dependencies between inputs and outputs are determined gradually through a
game of the system against the controller. In a system with a bidirectional type,
also the distinction between inputs and outputs is resolved dynamically by such
a game. The game proceeds in several rounds. In each round the system and the
controller choose to update some variables dependent on variables that have already
been updated. The solution of the control problem for dependent and bidirectional
types is based on algorithms for solving these games."
acknowledgement: This research was supported in part by the SRC contract 99-TJ-683.003,
the DARPA SEC grant F33615-C-98-3614, the MARCO GSRC grant 98-DT-660, the AFOSR
MURI grant F49620-00-1-0327, and the NSF Theory grant CCR-9988172.
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: Freddy
full_name: Mang, Freddy
last_name: Mang
citation:
ama: 'De Alfaro L, Henzinger TA, Mang F. The control of synchronous systems, Part
II. In: Proceedings of the 12th International Conference on on Concurrency
Theory. Vol 2154. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2001:566-581.
doi:10.1007/3-540-44685-0_38'
apa: 'De Alfaro, L., Henzinger, T. A., & Mang, F. (2001). The control of synchronous
systems, Part II. In Proceedings of the 12th International Conference on on
Concurrency Theory (Vol. 2154, pp. 566–581). Aalborg, Denmark: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.1007/3-540-44685-0_38'
chicago: De Alfaro, Luca, Thomas A Henzinger, and Freddy Mang. “The Control of Synchronous
Systems, Part II.” In Proceedings of the 12th International Conference on on
Concurrency Theory, 2154:566–81. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2001. https://doi.org/10.1007/3-540-44685-0_38.
ieee: L. De Alfaro, T. A. Henzinger, and F. Mang, “The control of synchronous systems,
Part II,” in Proceedings of the 12th International Conference on on Concurrency
Theory, Aalborg, Denmark, 2001, vol. 2154, pp. 566–581.
ista: 'De Alfaro L, Henzinger TA, Mang F. 2001. The control of synchronous systems,
Part II. Proceedings of the 12th International Conference on on Concurrency Theory.
CONCUR: Concurrency Theory, LNCS, vol. 2154, 566–581.'
mla: De Alfaro, Luca, et al. “The Control of Synchronous Systems, Part II.” Proceedings
of the 12th International Conference on on Concurrency Theory, vol. 2154,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2001, pp. 566–81, doi:10.1007/3-540-44685-0_38.
short: L. De Alfaro, T.A. Henzinger, F. Mang, in:, Proceedings of the 12th International
Conference on on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2001, pp. 566–581.
conference:
end_date: 2001-08-25
location: Aalborg, Denmark
name: 'CONCUR: Concurrency Theory'
start_date: 2001-08-20
date_created: 2018-12-11T12:09:52Z
date_published: 2001-08-13T00:00:00Z
date_updated: 2023-05-08T10:20:19Z
day: '13'
doi: 10.1007/3-540-44685-0_38
extern: '1'
intvolume: ' 2154'
language:
- iso: eng
month: '08'
oa_version: None
page: 566 - 581
publication: Proceedings of the 12th International Conference on on Concurrency Theory
publication_identifier:
isbn:
- '9783540424970'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '74'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The control of synchronous systems, Part II
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2154
year: '2001'
...
---
_id: '4635'
abstract:
- lang: eng
text: We show how model checking techniques can be applied to the analysis of connectivity
and cost-of-traversal properties of Web sites.
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: Freddy
full_name: Mang, Freddy
last_name: Mang
citation:
ama: 'De Alfaro L, Henzinger TA, Mang F. MCWEB: A model-checking tool for web-site
debugging. In: Proceedings of the 10th International Conference on World Wide
Web. ACM; 2001:86-87.'
apa: 'De Alfaro, L., Henzinger, T. A., & Mang, F. (2001). MCWEB: A model-checking
tool for web-site debugging. In Proceedings of the 10th international conference
on World Wide Web (pp. 86–87). Hong Kong, Hong Kong: ACM.'
chicago: 'De Alfaro, Luca, Thomas A Henzinger, and Freddy Mang. “MCWEB: A Model-Checking
Tool for Web-Site Debugging.” In Proceedings of the 10th International Conference
on World Wide Web, 86–87. ACM, 2001.'
ieee: 'L. De Alfaro, T. A. Henzinger, and F. Mang, “MCWEB: A model-checking tool
for web-site debugging,” in Proceedings of the 10th international conference
on World Wide Web, Hong Kong, Hong Kong, 2001, pp. 86–87.'
ista: 'De Alfaro L, Henzinger TA, Mang F. 2001. MCWEB: A model-checking tool for
web-site debugging. Proceedings of the 10th international conference on World
Wide Web. WWW: World Wide Web Conference, 86–87.'
mla: 'De Alfaro, Luca, et al. “MCWEB: A Model-Checking Tool for Web-Site Debugging.”
Proceedings of the 10th International Conference on World Wide Web, ACM,
2001, pp. 86–87.'
short: L. De Alfaro, T.A. Henzinger, F. Mang, in:, Proceedings of the 10th International
Conference on World Wide Web, ACM, 2001, pp. 86–87.
conference:
end_date: 2000-05-05
location: Hong Kong, Hong Kong
name: 'WWW: World Wide Web Conference'
start_date: 2001-05-01
date_created: 2018-12-11T12:09:52Z
date_published: 2001-05-01T00:00:00Z
date_updated: 2023-05-08T09:39:02Z
day: '01'
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://ir.webis.de/anthology/2001.wwwconf_conference-2001p.57/
month: '05'
oa_version: None
page: 86 - 87
publication: Proceedings of the 10th international conference on World Wide Web
publication_identifier:
isbn:
- '9781581133486'
publication_status: published
publisher: ACM
publist_id: '71'
quality_controlled: '1'
status: public
title: 'MCWEB: A model-checking tool for web-site debugging'
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '2001'
...
---
_id: '4636'
abstract:
- lang: eng
text: 'Abstract. Dynamic programs, or fixpoint iteration schemes, are useful for
solving many problems on state spaces, including model checking on Kripke structures
(“verification”), computing shortest paths on weighted graphs (“optimization”),
computing the value of games played on game graphs (“control”). For Kripke structures,
a rich fixpoint theory is available in the form of the µ-calculus. Yet few connections
have been made between different interpretations of fixpoint algorithms. We study
the question of when a particular fixpoint iteration scheme ϕ for verifying an
ω-regular property Ψ on a Kripke structure can be used also for solving a two-player
game on a game graph with winning objective Ψ. We provide a sufficient and necessary
criterion for the answer to be affirmative in the form of an extremal-model theorem
for games: under a game interpretation, the dynamic program ϕ solves the game
with objective Ψ if and only if both (1) under an existential interpretation on
Kripke structures, ϕ is equivalent to ∃Ψ, and (2) under a universal interpretation
on Kripke structures, ϕ is equivalent to ∀Ψ. In other words, ϕ is correct on all
two-player game graphs iff it is correct on all extremal game graphs, where one
or the other player has no choice of moves. The theorem generalizes to quantitative
interpretations, where it connects two-player games with costs to weighted graphs.
While the standard translations from ω-regular properties to the µ-calculus violate
(1) or (2), we give a translation that satisfies both conditions. Our construction,
therefore, yields fixpoint iteration schemes that can be uniformly applied on
Kripke structures, weighted graphs, game graphs, and game graphs with costs, in
order to meet or optimize a given ω-regular objective.'
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. From verification to control: dynamic
programs for omega-regular objectives. In: Proceedings of the 16th Annual IEEE
Symposium on Logic in Computer Science. IEEE; 2001:279-290. doi:10.1109/LICS.2001.932504'
apa: 'De Alfaro, L., Henzinger, T. A., & Majumdar, R. (2001). From verification
to control: dynamic programs for omega-regular objectives. In Proceedings of
the 16th Annual IEEE Symposium on Logic in Computer Science (pp. 279–290).
Boston, MA, USA: IEEE. https://doi.org/10.1109/LICS.2001.932504'
chicago: 'De Alfaro, Luca, Thomas A Henzinger, and Ritankar Majumdar. “From Verification
to Control: Dynamic Programs for Omega-Regular Objectives.” In Proceedings
of the 16th Annual IEEE Symposium on Logic in Computer Science, 279–90. IEEE,
2001. https://doi.org/10.1109/LICS.2001.932504.'
ieee: 'L. De Alfaro, T. A. Henzinger, and R. Majumdar, “From verification to control:
dynamic programs for omega-regular objectives,” in Proceedings of the 16th
Annual IEEE Symposium on Logic in Computer Science, Boston, MA, USA, 2001,
pp. 279–290.'
ista: 'De Alfaro L, Henzinger TA, Majumdar R. 2001. From verification to control:
dynamic programs for omega-regular objectives. Proceedings of the 16th Annual
IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science,
279–290.'
mla: 'De Alfaro, Luca, et al. “From Verification to Control: Dynamic Programs for
Omega-Regular Objectives.” Proceedings of the 16th Annual IEEE Symposium on
Logic in Computer Science, IEEE, 2001, pp. 279–90, doi:10.1109/LICS.2001.932504.'
short: L. De Alfaro, T.A. Henzinger, R. Majumdar, in:, Proceedings of the 16th Annual
IEEE Symposium on Logic in Computer Science, IEEE, 2001, pp. 279–290.
conference:
end_date: 2001-06-19
location: Boston, MA, USA
name: 'LICS: Logic in Computer Science'
start_date: 2001-06-16
date_created: 2018-12-11T12:09:52Z
date_published: 2001-08-07T00:00:00Z
date_updated: 2023-05-08T09:48:06Z
day: '07'
doi: 10.1109/LICS.2001.932504
extern: '1'
language:
- iso: eng
month: '08'
oa_version: None
page: 279 - 290
publication: Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
publication_identifier:
isbn:
- 076951281X
publication_status: published
publisher: IEEE
publist_id: '72'
quality_controlled: '1'
status: public
title: 'From verification to control: dynamic programs for omega-regular objectives'
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '2001'
...
---
_id: '12925'
abstract:
- lang: eng
text: Normal function of organs and cells is tightly linked to the cytoarchitecture.
Control of the cell volume is therefore vital for the organism. A widely established
strategy of cells to counteract swelling is the activation of chloride and potassium
channels, which leads to a net efflux of salt followed by water - a process termed
regulatory volume decrease. Since there is evidence for swelling-dependent chloride
channels (IClswell) being activated also during pathological processes, the identification
of the molecular entity underlying IClswell is of utmost importance. Several proteins
are discussed as the channel forming IClswell, i.e. phospholemman, p-glycoprotein,
CLC-3 and ICln. In this review we would like to focus on the properties of ICln,
a protein cloned from a Madin Darby canine kidney (MDCK) cell library whose expression
in Xenopus laevis oocytes resulted in a nucleotide sensitive outwardly rectifying
chloride current closely resembling the biophysical properties of IClswell.
article_processing_charge: No
article_type: original
author:
- first_name: Johannes
full_name: Fürst, Johannes
last_name: Fürst
- first_name: Martin
full_name: Jakab, Martin
last_name: Jakab
- first_name: Matthias
full_name: König, Matthias
last_name: König
- first_name: Markus
full_name: Ritter, Markus
last_name: Ritter
- first_name: Martin
full_name: Gschwentner, Martin
last_name: Gschwentner
- first_name: Jakob
full_name: Rudzki, Jakob
last_name: Rudzki
- first_name: Johann G
full_name: Danzl, Johann G
id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
last_name: Danzl
orcid: 0000-0001-8559-3973
- first_name: Michael
full_name: Mayer, Michael
last_name: Mayer
- first_name: Carmen M.
full_name: Burtscher, Carmen M.
last_name: Burtscher
- first_name: Julia
full_name: Schirmer, Julia
last_name: Schirmer
- first_name: Brigitte
full_name: Maier, Brigitte
last_name: Maier
- first_name: Manfred
full_name: Nairz, Manfred
last_name: Nairz
- first_name: Sabine
full_name: Chwatal, Sabine
last_name: Chwatal
- first_name: Markus
full_name: Paulmichl, Markus
last_name: Paulmichl
citation:
ama: Fürst J, Jakab M, König M, et al. Structure and Function of the Ion Channel
ICln. Cellular Physiology and Biochemistry. 2000;10(5-6):329-334. doi:10.1159/000016374
apa: Fürst, J., Jakab, M., König, M., Ritter, M., Gschwentner, M., Rudzki, J., …
Paulmichl, M. (2000). Structure and Function of the Ion Channel ICln. Cellular
Physiology and Biochemistry. S. Karger AG. https://doi.org/10.1159/000016374
chicago: Fürst, Johannes, Martin Jakab, Matthias König, Markus Ritter, Martin Gschwentner,
Jakob Rudzki, Johann G Danzl, et al. “Structure and Function of the Ion Channel
ICln.” Cellular Physiology and Biochemistry. S. Karger AG, 2000. https://doi.org/10.1159/000016374.
ieee: J. Fürst et al., “Structure and Function of the Ion Channel ICln,”
Cellular Physiology and Biochemistry, vol. 10, no. 5–6. S. Karger AG, pp.
329–334, 2000.
ista: Fürst J, Jakab M, König M, Ritter M, Gschwentner M, Rudzki J, Danzl JG, Mayer
M, Burtscher CM, Schirmer J, Maier B, Nairz M, Chwatal S, Paulmichl M. 2000. Structure
and Function of the Ion Channel ICln. Cellular Physiology and Biochemistry. 10(5–6),
329–334.
mla: Fürst, Johannes, et al. “Structure and Function of the Ion Channel ICln.” Cellular
Physiology and Biochemistry, vol. 10, no. 5–6, S. Karger AG, 2000, pp. 329–34,
doi:10.1159/000016374.
short: J. Fürst, M. Jakab, M. König, M. Ritter, M. Gschwentner, J. Rudzki, J.G.
Danzl, M. Mayer, C.M. Burtscher, J. Schirmer, B. Maier, M. Nairz, S. Chwatal,
M. Paulmichl, Cellular Physiology and Biochemistry 10 (2000) 329–334.
date_created: 2023-05-08T09:04:58Z
date_published: 2000-01-01T00:00:00Z
date_updated: 2023-05-08T10:07:10Z
doi: 10.1159/000016374
extern: '1'
external_id:
pmid:
- '11125213'
intvolume: ' 10'
issue: 5-6
keyword:
- Physiology
language:
- iso: eng
oa_version: None
page: 329-334
pmid: 1
publication: Cellular Physiology and Biochemistry
publication_identifier:
issn:
- 1015-8987
- 1421-9778
publication_status: published
publisher: S. Karger AG
quality_controlled: '1'
scopus_import: '1'
status: public
title: Structure and Function of the Ion Channel ICln
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10
year: '2000'
...
---
_id: '842'
article_processing_charge: No
article_type: original
author:
- first_name: Yuri
full_name: Wolf, Yuri
last_name: Wolf
- first_name: Fyodor
full_name: Kondrashov, Fyodor
id: 44FDEF62-F248-11E8-B48F-1D18A9856A87
last_name: Kondrashov
orcid: 0000-0001-8243-4694
- first_name: Eugene
full_name: Koonin, Eugene
last_name: Koonin
citation:
ama: Wolf Y, Kondrashov F, Koonin E. No footprints of primordial introns in a eukaryotic
genome. Trends in Genetics. 2000;16(8):333-334. doi:10.1016/S0168-9525(00)02059-X
apa: Wolf, Y., Kondrashov, F., & Koonin, E. (2000). No footprints of primordial
introns in a eukaryotic genome. Trends in Genetics. Elsevier. https://doi.org/10.1016/S0168-9525(00)02059-X
chicago: Wolf, Yuri, Fyodor Kondrashov, and Eugene Koonin. “No Footprints of Primordial
Introns in a Eukaryotic Genome.” Trends in Genetics. Elsevier, 2000. https://doi.org/10.1016/S0168-9525(00)02059-X.
ieee: Y. Wolf, F. Kondrashov, and E. Koonin, “No footprints of primordial introns
in a eukaryotic genome,” Trends in Genetics, vol. 16, no. 8. Elsevier,
pp. 333–334, 2000.
ista: Wolf Y, Kondrashov F, Koonin E. 2000. No footprints of primordial introns
in a eukaryotic genome. Trends in Genetics. 16(8), 333–334.
mla: Wolf, Yuri, et al. “No Footprints of Primordial Introns in a Eukaryotic Genome.”
Trends in Genetics, vol. 16, no. 8, Elsevier, 2000, pp. 333–34, doi:10.1016/S0168-9525(00)02059-X.
short: Y. Wolf, F. Kondrashov, E. Koonin, Trends in Genetics 16 (2000) 333–334.
date_created: 2018-12-11T11:48:48Z
date_published: 2000-08-01T00:00:00Z
date_updated: 2023-05-08T09:22:03Z
day: '01'
doi: 10.1016/S0168-9525(00)02059-X
extern: '1'
external_id:
pmid:
- '10904260 '
intvolume: ' 16'
issue: '8'
language:
- iso: eng
month: '08'
oa_version: None
page: 333 - 334
pmid: 1
publication: Trends in Genetics
publication_identifier:
issn:
- 0168-9479
publication_status: published
publisher: Elsevier
publist_id: '6806'
quality_controlled: '1'
scopus_import: '1'
status: public
title: No footprints of primordial introns in a eukaryotic genome
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 16
year: '2000'
...
---
_id: '8525'
abstract:
- lang: eng
text: Let M be a smooth compact manifold of dimension at least 2 and Diffr(M) be
the space of C r smooth diffeomorphisms of M. Associate to each diffeomorphism
f;isin; Diffr(M) the sequence P n (f) of the number of isolated periodic points
for f of period n. In this paper we exhibit an open set N in the space of diffeomorphisms
Diffr(M) such for a Baire generic diffeomorphism f∈N the number of periodic points
P n f grows with a period n faster than any following sequence of numbers {a n
} n ∈ Z + along a subsequence, i.e. P n (f)>a ni for some n i →∞ with i→∞. In
the cases of surface diffeomorphisms, i.e. dim M≡2, an open set N with a supergrowth
of the number of periodic points is a Newhouse domain. A proof of the man result
is based on the Gontchenko–Shilnikov–Turaev Theorem [GST]. A complete proof of
that theorem is also presented.
article_processing_charge: No
article_type: original
author:
- first_name: Vadim
full_name: Kaloshin, Vadim
id: FE553552-CDE8-11E9-B324-C0EBE5697425
last_name: Kaloshin
orcid: 0000-0002-6051-2628
citation:
ama: Kaloshin V. Generic diffeomorphisms with superexponential growth of number
of periodic orbits. Communications in Mathematical Physics. 2000;211:253-271.
doi:10.1007/s002200050811
apa: Kaloshin, V. (2000). Generic diffeomorphisms with superexponential growth of
number of periodic orbits. Communications in Mathematical Physics. Springer
Nature. https://doi.org/10.1007/s002200050811
chicago: Kaloshin, Vadim. “Generic Diffeomorphisms with Superexponential Growth
of Number of Periodic Orbits.” Communications in Mathematical Physics.
Springer Nature, 2000. https://doi.org/10.1007/s002200050811.
ieee: V. Kaloshin, “Generic diffeomorphisms with superexponential growth of number
of periodic orbits,” Communications in Mathematical Physics, vol. 211.
Springer Nature, pp. 253–271, 2000.
ista: Kaloshin V. 2000. Generic diffeomorphisms with superexponential growth of
number of periodic orbits. Communications in Mathematical Physics. 211, 253–271.
mla: Kaloshin, Vadim. “Generic Diffeomorphisms with Superexponential Growth of Number
of Periodic Orbits.” Communications in Mathematical Physics, vol. 211,
Springer Nature, 2000, pp. 253–71, doi:10.1007/s002200050811.
short: V. Kaloshin, Communications in Mathematical Physics 211 (2000) 253–271.
date_created: 2020-09-18T10:50:20Z
date_published: 2000-04-01T00:00:00Z
date_updated: 2021-01-12T08:19:52Z
day: '01'
doi: 10.1007/s002200050811
extern: '1'
intvolume: ' 211'
keyword:
- Mathematical Physics
- Statistical and Nonlinear Physics
language:
- iso: eng
month: '04'
oa_version: None
page: 253-271
publication: Communications in Mathematical Physics
publication_identifier:
issn:
- 0010-3616
- 1432-0916
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Generic diffeomorphisms with superexponential growth of number of periodic
orbits
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 211
year: '2000'
...
---
_id: '1736'
abstract:
- lang: eng
text: A coding scheme called diode is compared with duobinary signalling and with
normal binary transmission. It is shown that the diode coding suppresses the FWM
products of a three channel DWDM system and this reduction against that achieved
with duobinary coding is presented. The results presented show how the average
level of the FWM products relative to the average levels of the three optical
carriers vary over the channel spacing range. The suppression observed is about
/ dB more than that achieved with duobinary modulation and is greater for narrow
channel spacing.
alternative_title:
- LEOS
article_processing_charge: No
author:
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
- first_name: Phil
full_name: Lane, Phil
last_name: Lane
- first_name: Michelle
full_name: Murphy, Michelle
last_name: Murphy
citation:
ama: 'Katsaros G, Lane P, Murphy M. Comparison of the impact of FWM on binary, duobinary
and dicode modulation in DWDM systems. In: Proceedings of the 2000 IEEE Annual
Meeting Conference . Vol 1. IEEE; 2000:27-28. doi:10.1109/LEOS.2000.890656'
apa: 'Katsaros, G., Lane, P., & Murphy, M. (2000). Comparison of the impact
of FWM on binary, duobinary and dicode modulation in DWDM systems. In Proceedings
of the 2000 IEEE Annual Meeting Conference (Vol. 1, pp. 27–28). Rio Grande,
PR, USA: IEEE. https://doi.org/10.1109/LEOS.2000.890656'
chicago: Katsaros, Georgios, Phil Lane, and Michelle Murphy. “Comparison of the
Impact of FWM on Binary, Duobinary and Dicode Modulation in DWDM Systems.” In
Proceedings of the 2000 IEEE Annual Meeting Conference , 1:27–28. IEEE,
2000. https://doi.org/10.1109/LEOS.2000.890656.
ieee: G. Katsaros, P. Lane, and M. Murphy, “Comparison of the impact of FWM on binary,
duobinary and dicode modulation in DWDM systems,” in Proceedings of the 2000
IEEE Annual Meeting Conference , Rio Grande, PR, USA, 2000, vol. 1, pp. 27–28.
ista: Katsaros G, Lane P, Murphy M. 2000. Comparison of the impact of FWM on binary,
duobinary and dicode modulation in DWDM systems. Proceedings of the 2000 IEEE
Annual Meeting Conference . Lasers and Electro Optics Society Annual Meeting,
LEOS, vol. 1, 27–28.
mla: Katsaros, Georgios, et al. “Comparison of the Impact of FWM on Binary, Duobinary
and Dicode Modulation in DWDM Systems.” Proceedings of the 2000 IEEE Annual
Meeting Conference , vol. 1, IEEE, 2000, pp. 27–28, doi:10.1109/LEOS.2000.890656.
short: G. Katsaros, P. Lane, M. Murphy, in:, Proceedings of the 2000 IEEE Annual
Meeting Conference , IEEE, 2000, pp. 27–28.
conference:
end_date: 2000-11-16
location: Rio Grande, PR, USA
name: Lasers and Electro Optics Society Annual Meeting
start_date: 2000-11-13
date_created: 2018-12-11T11:53:44Z
date_published: 2000-01-01T00:00:00Z
date_updated: 2023-05-04T14:46:21Z
day: '01'
doi: 10.1109/LEOS.2000.890656
extern: '1'
intvolume: ' 1'
language:
- iso: eng
month: '01'
oa_version: None
page: 27 - 28
publication: 'Proceedings of the 2000 IEEE Annual Meeting Conference '
publication_identifier:
isbn:
- 078035947X
publication_status: published
publisher: IEEE
publist_id: '5388'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Comparison of the impact of FWM on binary, duobinary and dicode modulation
in DWDM systems
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1
year: '2000'
...
---
_id: '1957'
abstract:
- lang: eng
text: NADH:ubiquinone oxidoreductase (complex I) is the first and largest enzyme
of the mitochondrial respiratory chain. The low-resolution structure of the complex
is known from electron microscopy studies. The general shape of the complex is
in the form of an L, with one arm in the membrane and the other peripheral. We
have purified complex I from beef heart mitochondria and reconstituted the enzyme
into lipid bilayers. Under different conditions, several two-dimensional crystal
forms were obtained. Crystals belonging to space groups p2221 and c12 (unit cell
488 Å x 79 Å) were obtained at 22°C and contained only the membrane fragment of
complex I similar to hydrophobic subcomplex Iβ but lacking the ND5 subunit. A
crystal form with larger unit cell (534 Å x 81 Å, space group c12) produced at
4°C contained both the peripheral and membrane arms of the enzyme, except that
ND5 was missing. Projection maps from frozen hydrated samples were calculated
for all crystal forms. By comparing two different c12 crystal forms, extra electron
density in the projection map of large crystal form was assigned to the peripheral
arm of the enzyme. One of the features of the map is a deep, channel-like, cleft
next to peripheral arm. Comparison with available structures of the intact enzyme
indicates that large hydrophobic subunit ND5 is situated at the distal end of
the membrane domain. Possible locations of sub-unit ND4 and of other subunits
in the membrane domain are proposed. Implications of our findings for the mechanism
of proton pumping by complex I are discussed. (C) 2000 Academic Press.
acknowledgement: We thank Drs I. M. Fearnley and S. Y. Peak-Chew for performing peptide
mass mapping. We also thank Drs R. Henderson and G. F. X. Schertler for advice on
image processing and for valuable discussions.
article_processing_charge: No
article_type: original
author:
- first_name: Leonid A
full_name: Sazanov, Leonid A
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
- first_name: John
full_name: Walker, John
last_name: Walker
citation:
ama: Sazanov LA, Walker J. Cryo-electron crystallography of two sub-complexes of
bovine complex I reveals the relationship between the membrane and peripheral
arms. Journal of Molecular Biology. 2000;302(2):455-464. doi:10.1006/jmbi.2000.4079
apa: Sazanov, L. A., & Walker, J. (2000). Cryo-electron crystallography of two
sub-complexes of bovine complex I reveals the relationship between the membrane
and peripheral arms. Journal of Molecular Biology. Elsevier. https://doi.org/10.1006/jmbi.2000.4079
chicago: Sazanov, Leonid A, and John Walker. “Cryo-Electron Crystallography of Two
Sub-Complexes of Bovine Complex I Reveals the Relationship between the Membrane
and Peripheral Arms.” Journal of Molecular Biology. Elsevier, 2000. https://doi.org/10.1006/jmbi.2000.4079.
ieee: L. A. Sazanov and J. Walker, “Cryo-electron crystallography of two sub-complexes
of bovine complex I reveals the relationship between the membrane and peripheral
arms,” Journal of Molecular Biology, vol. 302, no. 2. Elsevier, pp. 455–464,
2000.
ista: Sazanov LA, Walker J. 2000. Cryo-electron crystallography of two sub-complexes
of bovine complex I reveals the relationship between the membrane and peripheral
arms. Journal of Molecular Biology. 302(2), 455–464.
mla: Sazanov, Leonid A., and John Walker. “Cryo-Electron Crystallography of Two
Sub-Complexes of Bovine Complex I Reveals the Relationship between the Membrane
and Peripheral Arms.” Journal of Molecular Biology, vol. 302, no. 2, Elsevier,
2000, pp. 455–64, doi:10.1006/jmbi.2000.4079.
short: L.A. Sazanov, J. Walker, Journal of Molecular Biology 302 (2000) 455–464.
date_created: 2018-12-11T11:54:55Z
date_published: 2000-09-15T00:00:00Z
date_updated: 2023-05-04T13:23:03Z
day: '15'
doi: 10.1006/jmbi.2000.4079
extern: '1'
external_id:
pmid:
- '10970745'
intvolume: ' 302'
issue: '2'
language:
- iso: eng
month: '09'
oa_version: None
page: 455 - 464
pmid: 1
publication: Journal of Molecular Biology
publication_identifier:
issn:
- 0022-2836
publication_status: published
publisher: Elsevier
publist_id: '5126'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Cryo-electron crystallography of two sub-complexes of bovine complex I reveals
the relationship between the membrane and peripheral arms
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 302
year: '2000'
...
---
_id: '1958'
abstract:
- lang: eng
text: "\r\nComplex I (NADH:ubiquinone oxidoreductase) purified from bovine heart
mitochondria was treated with the detergent N,N-dimethyldodecylamine N-oxide (LDAO).
The enzyme dissociated into two known subcomplexes, Iα and Iβ, containing mostly
hydrophilic and hydrophobic subunits, and a previously undetected fragment referred
to as Iγ. Subcomplex Iγ contains the hydrophobic subunits ND1, ND2, ND3, and ND4L
which are encoded in the mitochondrial genome, and the nuclear-encoded subunit
KFYL. During size- exclusion chromatography in the presence of LDAO, subcomplex
Iα lost several subunits and formed another characterized subcomplex known as
Iλ. Similarly, subcomplex Iβ dissociated into two smaller subcomplexes, one of
which contains the hydrophobic subunits ND4 and ND5; subcomplex Iγ released a
fragment containing ND1 and ND2. These results suggest that in the intact complex
subunits ND1 and ND2 are likely to be in a different region of the membrane domain
than subunits ND4 and ND5. The compositions of the various subcomplexes and fragments
of complex I provide an organization of the subunits of the enzyme in the framework
of the known low resolution structure of the enzyme."
article_processing_charge: No
article_type: original
author:
- first_name: Leonid A
full_name: Sazanov, Leonid A
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
- first_name: Sew
full_name: Peak Chew, Sew
last_name: Peak Chew
- first_name: Ian
full_name: Fearnley, Ian
last_name: Fearnley
- first_name: John
full_name: Walker, John
last_name: Walker
citation:
ama: 'Sazanov LA, Peak Chew S, Fearnley I, Walker J. Resolution of the membrane
domain of bovine complex I into subcomplexes: implications for the structural
organization of the enzyme. Biochemistry. 2000;39(24):7229-7235. doi:10.1021/bi000335t'
apa: 'Sazanov, L. A., Peak Chew, S., Fearnley, I., & Walker, J. (2000). Resolution
of the membrane domain of bovine complex I into subcomplexes: implications for
the structural organization of the enzyme. Biochemistry. ACS. https://doi.org/10.1021/bi000335t'
chicago: 'Sazanov, Leonid A, Sew Peak Chew, Ian Fearnley, and John Walker. “Resolution
of the Membrane Domain of Bovine Complex I into Subcomplexes: Implications for
the Structural Organization of the Enzyme.” Biochemistry. ACS, 2000. https://doi.org/10.1021/bi000335t.'
ieee: 'L. A. Sazanov, S. Peak Chew, I. Fearnley, and J. Walker, “Resolution of the
membrane domain of bovine complex I into subcomplexes: implications for the structural
organization of the enzyme,” Biochemistry, vol. 39, no. 24. ACS, pp. 7229–7235,
2000.'
ista: 'Sazanov LA, Peak Chew S, Fearnley I, Walker J. 2000. Resolution of the membrane
domain of bovine complex I into subcomplexes: implications for the structural
organization of the enzyme. Biochemistry. 39(24), 7229–7235.'
mla: 'Sazanov, Leonid A., et al. “Resolution of the Membrane Domain of Bovine Complex
I into Subcomplexes: Implications for the Structural Organization of the Enzyme.”
Biochemistry, vol. 39, no. 24, ACS, 2000, pp. 7229–35, doi:10.1021/bi000335t.'
short: L.A. Sazanov, S. Peak Chew, I. Fearnley, J. Walker, Biochemistry 39 (2000)
7229–7235.
date_created: 2018-12-11T11:54:55Z
date_published: 2000-05-24T00:00:00Z
date_updated: 2023-05-04T14:14:53Z
day: '24'
doi: 10.1021/bi000335t
extern: '1'
external_id:
pmid:
- '10852722'
intvolume: ' 39'
issue: '24'
language:
- iso: eng
month: '05'
oa_version: None
page: 7229 - 7235
pmid: 1
publication: Biochemistry
publication_identifier:
issn:
- 0006-2960
publication_status: published
publisher: ACS
publist_id: '5127'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Resolution of the membrane domain of bovine complex I into subcomplexes: implications
for the structural organization of the enzyme'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 39
year: '2000'
...
---
_id: '13437'
abstract:
- lang: eng
text: Liquid/liquid Phase Transfer Catalysis (PTC) reaction of 4-chlorobutyronitrile
with nonenolisable aldehydes leads via an addition-cyclisation reaction sequence
to derivatives of tetrahydrofuran-3-carbonitrile.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Mieczysław
full_name: Macogonkosza, Mieczysław
last_name: Macogonkosza
- first_name: Jacek
full_name: Przyborowski, Jacek
last_name: Przyborowski
- first_name: Rafal
full_name: Klajn, Rafal
id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b
last_name: Klajn
- first_name: Andrzej
full_name: Kwast, Andrzej
last_name: Kwast
citation:
ama: Macogonkosza M, Przyborowski J, Klajn R, Kwast A. Simple synthesis of 2-substituted
Tetrahydrofuran-3-carbonitriles. Synlett. 2000;2000(12):1773-1774. doi:10.1055/s-2000-8670
apa: Macogonkosza, M., Przyborowski, J., Klajn, R., & Kwast, A. (2000). Simple
synthesis of 2-substituted Tetrahydrofuran-3-carbonitriles. Synlett. Georg
Thieme Verlag. https://doi.org/10.1055/s-2000-8670
chicago: Macogonkosza, Mieczysław, Jacek Przyborowski, Rafal Klajn, and Andrzej
Kwast. “Simple Synthesis of 2-Substituted Tetrahydrofuran-3-Carbonitriles.” Synlett.
Georg Thieme Verlag, 2000. https://doi.org/10.1055/s-2000-8670.
ieee: M. Macogonkosza, J. Przyborowski, R. Klajn, and A. Kwast, “Simple synthesis
of 2-substituted Tetrahydrofuran-3-carbonitriles,” Synlett, vol. 2000,
no. 12. Georg Thieme Verlag, pp. 1773–1774, 2000.
ista: Macogonkosza M, Przyborowski J, Klajn R, Kwast A. 2000. Simple synthesis of
2-substituted Tetrahydrofuran-3-carbonitriles. Synlett. 2000(12), 1773–1774.
mla: Macogonkosza, Mieczysław, et al. “Simple Synthesis of 2-Substituted Tetrahydrofuran-3-Carbonitriles.”
Synlett, vol. 2000, no. 12, Georg Thieme Verlag, 2000, pp. 1773–74, doi:10.1055/s-2000-8670.
short: M. Macogonkosza, J. Przyborowski, R. Klajn, A. Kwast, Synlett 2000 (2000)
1773–1774.
date_created: 2023-08-01T10:39:48Z
date_published: 2000-12-01T00:00:00Z
date_updated: 2023-08-02T07:54:46Z
day: '01'
doi: 10.1055/s-2000-8670
extern: '1'
intvolume: ' 2000'
issue: '12'
keyword:
- Organic Chemistry
language:
- iso: eng
month: '12'
oa_version: None
page: 1773-1774
publication: Synlett
publication_identifier:
eissn:
- 1437-2096
issn:
- 0936-5214
publication_status: published
publisher: Georg Thieme Verlag
quality_controlled: '1'
scopus_import: '1'
status: public
title: Simple synthesis of 2-substituted Tetrahydrofuran-3-carbonitriles
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2000
year: '2000'
...
---
_id: '1455'
abstract:
- lang: eng
text: First, a special case of Knaster's problem is proved implying that each symmetric
convex body in ℝ3 admits an inscribed cube. It is deduced from a theorem in equivariant
topology, which says that there is no S4 - equivariant map from SO(3) to S2, where
S4 acts on SO(3) on the right as the rotation group of the cube, and on S2 on
the right as the symmetry group of the regular tetrahedron. Some generalizations
are also given. Second, it is shown how the above non-existence theorem yields
Makeev's conjecture in ℝ3 that each set in ℝ3 of diameter 1 can be covered by
a rhombic dodecahedron, which has distance 1 between its opposite faces. This
reveals an unexpected connection between inscribing cubes into symmetric bodies
and covering sets by rhombic dodecahedra. Finally, a possible application of our
second theorem to the Borsuk problem in ℝ3 is pointed out.
acknowledgement: The research of the first author was partially supported by Trinity
College, Cambridge, and that of all the authors by grants 23444, T-030012 and A
046/96, respectively, from the Hungarian National Foundation for Scientific Research.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Tamas
full_name: Hausel, Tamas
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
- first_name: Endre
full_name: Makai, Endre
last_name: Makai
- first_name: András
full_name: Szücs, András
last_name: Szücs
citation:
ama: Hausel T, Makai E, Szücs A. Inscribing cubes and covering by rhombic dodecahedra
via equivariant topology. Mathematika. 2000;47(1-2):371-397. doi:10.1112/S0025579300015965
apa: Hausel, T., Makai, E., & Szücs, A. (2000). Inscribing cubes and covering
by rhombic dodecahedra via equivariant topology. Mathematika. University
College London. https://doi.org/10.1112/S0025579300015965
chicago: Hausel, Tamás, Endre Makai, and András Szücs. “Inscribing Cubes and Covering
by Rhombic Dodecahedra via Equivariant Topology.” Mathematika. University
College London, 2000. https://doi.org/10.1112/S0025579300015965.
ieee: T. Hausel, E. Makai, and A. Szücs, “Inscribing cubes and covering by rhombic
dodecahedra via equivariant topology,” Mathematika, vol. 47, no. 1–2. University
College London, pp. 371–397, 2000.
ista: Hausel T, Makai E, Szücs A. 2000. Inscribing cubes and covering by rhombic
dodecahedra via equivariant topology. Mathematika. 47(1–2), 371–397.
mla: Hausel, Tamás, et al. “Inscribing Cubes and Covering by Rhombic Dodecahedra
via Equivariant Topology.” Mathematika, vol. 47, no. 1–2, University College
London, 2000, pp. 371–97, doi:10.1112/S0025579300015965.
short: T. Hausel, E. Makai, A. Szücs, Mathematika 47 (2000) 371–397.
date_created: 2018-12-11T11:52:07Z
date_published: 2000-06-01T00:00:00Z
date_updated: 2023-05-08T08:56:46Z
day: '01'
doi: 10.1112/S0025579300015965
extern: '1'
external_id:
arxiv:
- math/9906066
intvolume: ' 47'
issue: 1-2
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/math/9906066
month: '06'
oa: 1
oa_version: Preprint
page: 371 - 397
publication: Mathematika
publication_identifier:
issn:
- 0025-5793
publication_status: published
publisher: University College London
publist_id: '5745'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Inscribing cubes and covering by rhombic dodecahedra via equivariant topology
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 47
year: '2000'
...
---
_id: '11126'
abstract:
- lang: eng
text: Nuclear import of the two uracil-rich small nuclear ribonucleoprotein (U snRNP)
components U1A and U2B′′ is mediated by unusually long and complex nuclear localization
signals (NLSs). Here we investigate nuclear import of U1A and U2B′′ in vitro and
demonstrate that it occurs by an active, saturable process. Several lines of evidence
suggest that import of the two proteins occurs by an import mechanism different
to those characterized previously. No cross competition is seen with a variety
of previously studied NLSs. In contrast to import mediated by members of the importin-β
family of nucleocytoplasmic transport receptors, U1A/U2B′′ import is not inhibited
by either nonhydrolyzable guanosine triphosphate (GTP) analogues or by a mutant
of the GTPase Ran that is incapable of GTP hydrolysis. Adenosine triphosphate
is capable of supporting U1A and U2B′′ import, whereas neither nonhydrolyzable
adenosine triphosphate analogues nor GTP can do so. U1A and U2B′′ import in vitro
does not require the addition of soluble cytosolic proteins, but a factor or factors
required for U1A and U2B′′ import remains tightly associated with the nuclear
fraction of conventionally permeabilized cells. This activity can be solubilized
in the presence of elevated MgCl2. These data suggest that U1A and U2B′′ import
into the nucleus occurs by a hitherto uncharacterized mechanism.
article_processing_charge: No
article_type: original
author:
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
- first_name: Iain W.
full_name: Mattaj, Iain W.
last_name: Mattaj
citation:
ama: Hetzer M, Mattaj IW. An Atp-dependent, Ran-independent mechanism for nuclear
import of the U1a and U2b′′ spliceosome proteins. Journal of Cell Biology.
2000;148(2):293-304. doi:10.1083/jcb.148.2.293
apa: Hetzer, M., & Mattaj, I. W. (2000). An Atp-dependent, Ran-independent mechanism
for nuclear import of the U1a and U2b′′ spliceosome proteins. Journal of Cell
Biology. Rockefeller University Press. https://doi.org/10.1083/jcb.148.2.293
chicago: Hetzer, Martin, and Iain W. Mattaj. “An Atp-Dependent, Ran-Independent
Mechanism for Nuclear Import of the U1a and U2b′′ Spliceosome Proteins.” Journal
of Cell Biology. Rockefeller University Press, 2000. https://doi.org/10.1083/jcb.148.2.293.
ieee: M. Hetzer and I. W. Mattaj, “An Atp-dependent, Ran-independent mechanism for
nuclear import of the U1a and U2b′′ spliceosome proteins,” Journal of Cell
Biology, vol. 148, no. 2. Rockefeller University Press, pp. 293–304, 2000.
ista: Hetzer M, Mattaj IW. 2000. An Atp-dependent, Ran-independent mechanism for
nuclear import of the U1a and U2b′′ spliceosome proteins. Journal of Cell Biology.
148(2), 293–304.
mla: Hetzer, Martin, and Iain W. Mattaj. “An Atp-Dependent, Ran-Independent Mechanism
for Nuclear Import of the U1a and U2b′′ Spliceosome Proteins.” Journal of Cell
Biology, vol. 148, no. 2, Rockefeller University Press, 2000, pp. 293–304,
doi:10.1083/jcb.148.2.293.
short: M. Hetzer, I.W. Mattaj, Journal of Cell Biology 148 (2000) 293–304.
date_created: 2022-04-07T07:57:49Z
date_published: 2000-01-24T00:00:00Z
date_updated: 2022-07-18T08:58:29Z
day: '24'
doi: 10.1083/jcb.148.2.293
extern: '1'
external_id:
pmid:
- '10648562'
intvolume: ' 148'
issue: '2'
keyword:
- Cell Biology
language:
- iso: eng
month: '01'
oa_version: None
page: 293-304
pmid: 1
publication: Journal of Cell Biology
publication_identifier:
eissn:
- 1540-8140
issn:
- 0021-9525
publication_status: published
publisher: Rockefeller University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: An Atp-dependent, Ran-independent mechanism for nuclear import of the U1a and
U2b′′ spliceosome proteins
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 148
year: '2000'
...
---
_id: '11127'
abstract:
- lang: eng
text: Nuclear formation in Xenopus egg extracts requires cytosol and is inhibited
by GTPγS, indicating a requirement for GTPase activity. Nuclear envelope (NE)
vesicle fusion is extensively inhibited by GTPγS and two mutant forms of the Ran
GTPase, Q69L and T24N. Depletion of either Ran or RCC1, the exchange factor for
Ran, from the assembly reaction also inhibits this step of NE formation. Ran depletion
can be complemented by the addition of Ran loaded with either GTP or GDP but not
with GTPγS. RCC1 depletion is only complemented by RCC1 itself or by RanGTP. Thus,
generation of RanGTP by RCC1 and GTP hydrolysis by Ran are both required for the
extensive membrane fusion events that lead to NE formation.
article_processing_charge: No
article_type: original
author:
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
- first_name: Daniel
full_name: Bilbao-Cortés, Daniel
last_name: Bilbao-Cortés
- first_name: Tobias C
full_name: Walther, Tobias C
last_name: Walther
- first_name: Oliver J
full_name: Gruss, Oliver J
last_name: Gruss
- first_name: Iain W
full_name: Mattaj, Iain W
last_name: Mattaj
citation:
ama: Hetzer M, Bilbao-Cortés D, Walther TC, Gruss OJ, Mattaj IW. GTP hydrolysis
by Ran is required for nuclear envelope assembly. Molecular Cell. 2000;5(6):1013-1024.
doi:10.1016/s1097-2765(00)80266-x
apa: Hetzer, M., Bilbao-Cortés, D., Walther, T. C., Gruss, O. J., & Mattaj,
I. W. (2000). GTP hydrolysis by Ran is required for nuclear envelope assembly.
Molecular Cell. Elsevier. https://doi.org/10.1016/s1097-2765(00)80266-x
chicago: Hetzer, Martin, Daniel Bilbao-Cortés, Tobias C Walther, Oliver J Gruss,
and Iain W Mattaj. “GTP Hydrolysis by Ran Is Required for Nuclear Envelope Assembly.”
Molecular Cell. Elsevier, 2000. https://doi.org/10.1016/s1097-2765(00)80266-x.
ieee: M. Hetzer, D. Bilbao-Cortés, T. C. Walther, O. J. Gruss, and I. W. Mattaj,
“GTP hydrolysis by Ran is required for nuclear envelope assembly,” Molecular
Cell, vol. 5, no. 6. Elsevier, pp. 1013–1024, 2000.
ista: Hetzer M, Bilbao-Cortés D, Walther TC, Gruss OJ, Mattaj IW. 2000. GTP hydrolysis
by Ran is required for nuclear envelope assembly. Molecular Cell. 5(6), 1013–1024.
mla: Hetzer, Martin, et al. “GTP Hydrolysis by Ran Is Required for Nuclear Envelope
Assembly.” Molecular Cell, vol. 5, no. 6, Elsevier, 2000, pp. 1013–24,
doi:10.1016/s1097-2765(00)80266-x.
short: M. Hetzer, D. Bilbao-Cortés, T.C. Walther, O.J. Gruss, I.W. Mattaj, Molecular
Cell 5 (2000) 1013–1024.
date_created: 2022-04-07T07:57:59Z
date_published: 2000-06-01T00:00:00Z
date_updated: 2022-07-18T08:58:31Z
day: '01'
doi: 10.1016/s1097-2765(00)80266-x
extern: '1'
external_id:
pmid:
- '10911995'
intvolume: ' 5'
issue: '6'
keyword:
- Cell Biology
- Molecular Biology
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/S1097-2765(00)80266-X
month: '06'
oa: 1
oa_version: Published Version
page: 1013-1024
pmid: 1
publication: Molecular Cell
publication_identifier:
issn:
- 1097-2765
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: GTP hydrolysis by Ran is required for nuclear envelope assembly
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 5
year: '2000'
...
---
_id: '11683'
abstract:
- lang: eng
text: The vertex connectivity κ of a graph is the smallest number of vertices whose
deletion separates the graph or makes it trivial. We present the fastest known
deterministic algorithm for finding the vertex connectivity and a corresponding
separator. The time for a digraph having n vertices and m edges is O(min{κ3 +
n, κn}m); for an undirected graph the term m can be replaced by κn. A randomized
algorithm finds κ with error probability 1/2 in time O(nm). If the vertices have
nonnegative weights the weighted vertex connectivity is found in time O(κ1nmlog(n2/m))
where κ1 ≤ m/n is the unweighted vertex connectivity or in expected time O(nmlog(n2/m))
with error probability 1/2. The main algorithm combines two previous vertex connectivity
algorithms and a generalization of the preflow-push algorithm of Hao and Orlin
(1994, J. Algorithms17, 424–446) that computes edge connectivity.
article_processing_charge: No
article_type: original
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Satish
full_name: Rao, Satish
last_name: Rao
- first_name: Harold N.
full_name: Gabow, Harold N.
last_name: Gabow
citation:
ama: 'Henzinger MH, Rao S, Gabow HN. Computing vertex connectivity: New bounds from
old techniques. Journal of Algorithms. 2000;34(2):222-250. doi:10.1006/jagm.1999.1055'
apa: 'Henzinger, M. H., Rao, S., & Gabow, H. N. (2000). Computing vertex connectivity:
New bounds from old techniques. Journal of Algorithms. Elsevier. https://doi.org/10.1006/jagm.1999.1055'
chicago: 'Henzinger, Monika H, Satish Rao, and Harold N. Gabow. “Computing Vertex
Connectivity: New Bounds from Old Techniques.” Journal of Algorithms. Elsevier,
2000. https://doi.org/10.1006/jagm.1999.1055.'
ieee: 'M. H. Henzinger, S. Rao, and H. N. Gabow, “Computing vertex connectivity:
New bounds from old techniques,” Journal of Algorithms, vol. 34, no. 2.
Elsevier, pp. 222–250, 2000.'
ista: 'Henzinger MH, Rao S, Gabow HN. 2000. Computing vertex connectivity: New bounds
from old techniques. Journal of Algorithms. 34(2), 222–250.'
mla: 'Henzinger, Monika H., et al. “Computing Vertex Connectivity: New Bounds from
Old Techniques.” Journal of Algorithms, vol. 34, no. 2, Elsevier, 2000,
pp. 222–50, doi:10.1006/jagm.1999.1055.'
short: M.H. Henzinger, S. Rao, H.N. Gabow, Journal of Algorithms 34 (2000) 222–250.
date_created: 2022-07-28T08:56:10Z
date_published: 2000-02-01T00:00:00Z
date_updated: 2022-09-12T09:06:48Z
day: '01'
doi: 10.1006/jagm.1999.1055
extern: '1'
intvolume: ' 34'
issue: '2'
keyword:
- Computational Theory and Mathematics
- Computational Mathematics
- Control and Optimization
language:
- iso: eng
month: '02'
oa_version: None
page: 222-250
publication: Journal of Algorithms
publication_identifier:
issn:
- 0196-6774
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Computing vertex connectivity: New bounds from old techniques'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2000'
...
---
_id: '11685'
abstract:
- lang: eng
text: We consider the problem of sampling URLs uniformly at random from the Web.
A tool for sampling URLs uniformly can be used to estimate various properties
of Web pages, such as the fraction of pages in various Internet domains or written
in various languages. Moreover, uniform URL sampling can be used to determine
the sizes of various search engines relative to the entire Web. In this paper,
we consider sampling approaches based on random walks of the Web graph. In particular,
we suggest ways of improving sampling based on random walks to make the samples
closer to uniform. We suggest a natural test bed based on random graphs for testing
the effectiveness of our procedures. We then use our sampling approach to estimate
the distribution of pages over various Internet domains and to estimate the coverage
of various search engine indexes.
article_processing_charge: No
article_type: original
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Allan
full_name: Heydon, Allan
last_name: Heydon
- first_name: Michael
full_name: Mitzenmacher, Michael
last_name: Mitzenmacher
- first_name: Marc
full_name: Najork, Marc
last_name: Najork
citation:
ama: Henzinger MH, Heydon A, Mitzenmacher M, Najork M. On near-uniform URL sampling.
Computer Networks. 2000;33(1-6):295-308. doi:10.1016/s1389-1286(00)00055-4
apa: Henzinger, M. H., Heydon, A., Mitzenmacher, M., & Najork, M. (2000). On
near-uniform URL sampling. Computer Networks. Elsevier. https://doi.org/10.1016/s1389-1286(00)00055-4
chicago: Henzinger, Monika H, Allan Heydon, Michael Mitzenmacher, and Marc Najork.
“On Near-Uniform URL Sampling.” Computer Networks. Elsevier, 2000. https://doi.org/10.1016/s1389-1286(00)00055-4.
ieee: M. H. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork, “On near-uniform
URL sampling,” Computer Networks, vol. 33, no. 1–6. Elsevier, pp. 295–308,
2000.
ista: Henzinger MH, Heydon A, Mitzenmacher M, Najork M. 2000. On near-uniform URL
sampling. Computer Networks. 33(1–6), 295–308.
mla: Henzinger, Monika H., et al. “On Near-Uniform URL Sampling.” Computer Networks,
vol. 33, no. 1–6, Elsevier, 2000, pp. 295–308, doi:10.1016/s1389-1286(00)00055-4.
short: M.H. Henzinger, A. Heydon, M. Mitzenmacher, M. Najork, Computer Networks
33 (2000) 295–308.
date_created: 2022-07-28T15:11:53Z
date_published: 2000-06-01T00:00:00Z
date_updated: 2022-09-12T09:09:13Z
day: '01'
doi: 10.1016/s1389-1286(00)00055-4
extern: '1'
intvolume: ' 33'
issue: 1-6
keyword:
- URL sampling
- Random walks
- Internet domain distribution
- Search engine size
language:
- iso: eng
month: '06'
oa_version: None
page: 295-308
publication: Computer Networks
publication_identifier:
issn:
- 1389-1286
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: On near-uniform URL sampling
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '2000'
...
---
_id: '11694'
abstract:
- lang: eng
text: We consider exploration problems where a robot has to construct a complete
map of an unknown environment. We assume that the environment is modeled by a
directed, strongly connected graph. The robot's task is to visit all nodes and
edges of the graph using the minimum number R of edge traversals. Deng and Papadimitriou
[Proceedings of the 31st Symposium on the Foundations of Computer Science, 1990,
pp. 356-361] showed an upper bound for R ofd O(d)m and Koutsoupias (reported by
Deng and Papadimitriou) gave a lower bound of Ω≠(d2m), where m is the number of
edges in the graph and d is the minimum number of edges that have to be added
to make the graph Eulerian. We give the 1rst subexponential algorithm for this
exploration problem, which achieves an upper bound of dO(logd)m. We also show
a matching lower bound of d≠(logd)m for our algorithm. Additionally, we give lower
bounds of 2≠(d)m, respectively, d≠(logd)m for various other natural exploration
algorithms.
acknowledgement: We thank Prabhakar Raghavan for bringing to our attention the literature
on the s-t connectivity problem. We also thank an anonymous referee for many helpful
comments which improved the presentation of the paper.
article_processing_charge: No
article_type: original
author:
- first_name: Susanne
full_name: Albers, Susanne
last_name: Albers
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
citation:
ama: Albers S, Henzinger MH. Exploring unknown environments. SIAM Journal on
Computing. 2000;29(4):1164-1188. doi:10.1137/s009753979732428x
apa: 'Albers, S., & Henzinger, M. H. (2000). Exploring unknown environments.
SIAM Journal on Computing. El Paso, TX, United States: Society for Industrial
and Applied Mathematics. https://doi.org/10.1137/s009753979732428x'
chicago: Albers, Susanne, and Monika H Henzinger. “Exploring Unknown Environments.”
SIAM Journal on Computing. Society for Industrial and Applied Mathematics,
2000. https://doi.org/10.1137/s009753979732428x.
ieee: S. Albers and M. H. Henzinger, “Exploring unknown environments,” SIAM Journal
on Computing, vol. 29, no. 4. Society for Industrial and Applied Mathematics,
pp. 1164–1188, 2000.
ista: Albers S, Henzinger MH. 2000. Exploring unknown environments. SIAM Journal
on Computing. 29(4), 1164–1188.
mla: Albers, Susanne, and Monika H. Henzinger. “Exploring Unknown Environments.”
SIAM Journal on Computing, vol. 29, no. 4, Society for Industrial and Applied
Mathematics, 2000, pp. 1164–88, doi:10.1137/s009753979732428x.
short: S. Albers, M.H. Henzinger, SIAM Journal on Computing 29 (2000) 1164–1188.
conference:
end_date: 1997-05-06
location: El Paso, TX, United States
name: 'STOC97: 29th Annual Symposium on Theory of Computing'
start_date: 1997-05-04
date_created: 2022-07-29T09:04:36Z
date_published: 2000-07-01T00:00:00Z
date_updated: 2023-02-17T14:41:36Z
day: '01'
doi: 10.1137/s009753979732428x
extern: '1'
intvolume: ' 29'
issue: '4'
keyword:
- directed graph
- exploration algorithm
language:
- iso: eng
month: '07'
oa_version: None
page: 1164-1188
publication: SIAM Journal on Computing
publication_identifier:
eissn:
- 1095-7111
issn:
- 0097-5397
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Exploring unknown environments
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 29
year: '2000'
...
---
_id: '11770'
abstract:
- lang: eng
text: 'We compare several algorithms for identifying mirrored hosts on the World
Wide Web. The algorithms operate on the basis of URL strings and linkage data:
the type of information about Web pages easily available from Web proxies and
crawlers. Identification of mirrored hosts can improve Web-based information retrieval
in several ways: first, by identifying mirrored hosts, search engines can avoid
storing and returning duplicate documents. Second, several new information retrieval
techniques for the Web make inferences based on the explicit links among hypertext
documents—mirroring perturbs their graph model and degrades performance. Third,
mirroring information can be used to redirect users to alternate mirror sites
to compensate for various failures, and can thus improve the performance of Web
browsers and proxies. We evaluated four classes of “top-down” algorithms for detecting
mirrored host pairs (that is, algorithms that are based on page attributes such
as URL, IP address, and hyperlinks between pages, and not on the page content)
on a collection of 140 million URLs (on 230,000 hosts) and their associated connectivity
information. Our best approach is one which combines five algorithms and achieved
a precision of 0.57 for a recall of 0.86 considering 100,000 ranked host pairs.'
article_processing_charge: No
article_type: original
author:
- first_name: Krishna
full_name: Bharat, Krishna
last_name: Bharat
- first_name: Andrei
full_name: Broder, Andrei
last_name: Broder
- first_name: Jeffrey
full_name: Dean, Jeffrey
last_name: Dean
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
citation:
ama: Bharat K, Broder A, Dean J, Henzinger MH. A comparison of techniques to find
mirrored hosts on the WWW. Journal of the American Society for Information
Science. 2000;51(12):1114-1122. doi:10.1002/1097-4571(2000)9999:9999<::aid-asi1025>3.0.co;2-0
apa: Bharat, K., Broder, A., Dean, J., & Henzinger, M. H. (2000). A comparison
of techniques to find mirrored hosts on the WWW. Journal of the American Society
for Information Science. Wiley. https://doi.org/10.1002/1097-4571(2000)9999:9999<::aid-asi1025>3.0.co;2-0
chicago: Bharat, Krishna, Andrei Broder, Jeffrey Dean, and Monika H Henzinger. “A
Comparison of Techniques to Find Mirrored Hosts on the WWW.” Journal of the
American Society for Information Science. Wiley, 2000. https://doi.org/10.1002/1097-4571(2000)9999:9999<::aid-asi1025>3.0.co;2-0.
ieee: K. Bharat, A. Broder, J. Dean, and M. H. Henzinger, “A comparison of techniques
to find mirrored hosts on the WWW,” Journal of the American Society for Information
Science, vol. 51, no. 12. Wiley, pp. 1114–1122, 2000.
ista: Bharat K, Broder A, Dean J, Henzinger MH. 2000. A comparison of techniques
to find mirrored hosts on the WWW. Journal of the American Society for Information
Science. 51(12), 1114–1122.
mla: Bharat, Krishna, et al. “A Comparison of Techniques to Find Mirrored Hosts
on the WWW.” Journal of the American Society for Information Science, vol.
51, no. 12, Wiley, 2000, pp. 1114–22, doi:10.1002/1097-4571(2000)9999:9999<::aid-asi1025>3.0.co;2-0.
short: K. Bharat, A. Broder, J. Dean, M.H. Henzinger, Journal of the American Society
for Information Science 51 (2000) 1114–1122.
date_created: 2022-08-08T12:57:37Z
date_published: 2000-10-01T00:00:00Z
date_updated: 2023-02-10T08:27:19Z
day: '01'
doi: 10.1002/1097-4571(2000)9999:9999<::aid-asi1025>3.0.co;2-0
extern: '1'
intvolume: ' 51'
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1002/1097-4571(2000)9999:9999<::aid-asi1025>3.0.co;2-0
month: '10'
oa: 1
oa_version: Published Version
page: 1114-1122
publication: Journal of the American Society for Information Science
publication_identifier:
issn:
- 0002-8231
- 1097-4571
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: A comparison of techniques to find mirrored hosts on the WWW
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 51
year: '2000'
...