---
_id: '11679'
abstract:
- lang: eng
  text: "We are given a set T = {T 1 ,T 2 , . . .,T k } of rooted binary trees, each
    T i leaf-labeled by a subset L(Ti)⊂{1,2,...,n} . If T is a tree on {1,2, . . .,n
    }, we let T|L denote the minimal subtree of T induced by the nodes of L and all
    their ancestors. The consensus tree problem asks whether there exists a tree T
    * such that, for every i , T∗|L(Ti) is homeomorphic to T i .\r\n\r\nWe present
    algorithms which test if a given set of trees has a consensus tree and if so,
    construct one. The deterministic algorithm takes time min{O(N n 1/2 ), O(N+ n
    2 log n )}, where N=∑i|Ti| , and uses linear space. The randomized algorithm takes
    time O(N log3 n) and uses linear space. The previous best for this problem was
    a 1981 O(Nn) algorithm by Aho et al. Our faster deterministic algorithm uses a
    new efficient algorithm for the following interesting dynamic graph problem: Given
    a graph G with n nodes and m edges and a sequence of b batches of one or more
    edge deletions, then, after each batch, either find a new component that has just
    been created or determine that there is no such component. For this problem, we
    have a simple algorithm with running time O(n 2 log n + b 0 min{n 2 , m log n
    }), where b 0 is the number of batches which do not result in a new component.
    For our particular application, b0≤1 . If all edges are deleted, then the best
    previously known deterministic algorithm requires time O(mn−−√) to solve this
    problem. We also present two applications of these consensus tree algorithms which
    solve other problems in computational evolutionary biology."
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: V.
  full_name: King, V.
  last_name: King
- first_name: T.
  full_name: Warnow, T.
  last_name: Warnow
citation:
  ama: Henzinger M, King V, Warnow T. Constructing a tree from homeomorphic subtrees,
    with applications to computational evolutionary biology. <i>Algorithmica</i>.
    1999;24:1-13. doi:<a href="https://doi.org/10.1007/pl00009268">10.1007/pl00009268</a>
  apa: Henzinger, M., King, V., &#38; Warnow, T. (1999). Constructing a tree from
    homeomorphic subtrees, with applications to computational evolutionary biology.
    <i>Algorithmica</i>. Springer Nature. <a href="https://doi.org/10.1007/pl00009268">https://doi.org/10.1007/pl00009268</a>
  chicago: Henzinger, Monika, V. King, and T. Warnow. “Constructing a Tree from Homeomorphic
    Subtrees, with Applications to Computational Evolutionary Biology.” <i>Algorithmica</i>.
    Springer Nature, 1999. <a href="https://doi.org/10.1007/pl00009268">https://doi.org/10.1007/pl00009268</a>.
  ieee: M. Henzinger, V. King, and T. Warnow, “Constructing a tree from homeomorphic
    subtrees, with applications to computational evolutionary biology,” <i>Algorithmica</i>,
    vol. 24. Springer Nature, pp. 1–13, 1999.
  ista: Henzinger M, King V, Warnow T. 1999. Constructing a tree from homeomorphic
    subtrees, with applications to computational evolutionary biology. Algorithmica.
    24, 1–13.
  mla: Henzinger, Monika, et al. “Constructing a Tree from Homeomorphic Subtrees,
    with Applications to Computational Evolutionary Biology.” <i>Algorithmica</i>,
    vol. 24, Springer Nature, 1999, pp. 1–13, doi:<a href="https://doi.org/10.1007/pl00009268">10.1007/pl00009268</a>.
  short: M. Henzinger, V. King, T. Warnow, Algorithmica 24 (1999) 1–13.
date_created: 2022-07-27T15:02:28Z
date_published: 1999-05-01T00:00:00Z
date_updated: 2024-11-04T11:41:23Z
day: '01'
doi: 10.1007/pl00009268
extern: '1'
intvolume: '        24'
keyword:
- Algorithms
- Data structures
- Evolutionary biology
- Theory of databases
language:
- iso: eng
month: '05'
oa_version: None
page: 1-13
publication: Algorithmica
publication_identifier:
  eissn:
  - 1432-0541
  issn:
  - 0178-4617
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  record:
  - id: '11927'
    relation: earlier_version
    status: public
scopus_import: '1'
status: public
title: Constructing a tree from homeomorphic subtrees, with applications to computational
  evolutionary biology
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 24
year: '1999'
...
---
_id: '11687'
abstract:
- lang: eng
  text: "When using traditional search engines, users have to formulate queries to
    describe their information need. This paper discusses a different approach to
    Web searching where the input to the search process is not a set of query terms,
    but instead is the URL of a page, and the output is a set of related Web pages.
    A related Web page is one that addresses the same topic as the original page.
    For example, www.washingtonpost.com is a page related to www.nytimes.com, since
    both are online newspapers.\r\n\r\nWe describe two algorithms to identify related
    Web pages. These algorithms use only the connectivity information in the Web (i.e.,
    the links between pages) and not the content of pages or usage information. We
    have implemented both algorithms and measured their runtime performance. To evaluate
    the effectiveness of our algorithms, we performed a user study comparing our algorithms
    with Netscape's `What's Related' service (http://home.netscape.com/escapes/related/).
    Our study showed that the precision at 10 for our two algorithms are 73% better
    and 51% better than that of Netscape, despite the fact that Netscape uses both
    content and usage pattern information in addition to connectivity information."
article_processing_charge: No
article_type: original
author:
- 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: Dean J, Henzinger M. Finding related pages in the world wide Web. <i>Computer
    Networks</i>. 1999;31(11-16):1467-1479. doi:<a href="https://doi.org/10.1016/s1389-1286(99)00022-5">10.1016/s1389-1286(99)00022-5</a>
  apa: Dean, J., &#38; Henzinger, M. (1999). Finding related pages in the world wide
    Web. <i>Computer Networks</i>. Elsevier. <a href="https://doi.org/10.1016/s1389-1286(99)00022-5">https://doi.org/10.1016/s1389-1286(99)00022-5</a>
  chicago: Dean, Jeffrey, and Monika Henzinger. “Finding Related Pages in the World
    Wide Web.” <i>Computer Networks</i>. Elsevier, 1999. <a href="https://doi.org/10.1016/s1389-1286(99)00022-5">https://doi.org/10.1016/s1389-1286(99)00022-5</a>.
  ieee: J. Dean and M. Henzinger, “Finding related pages in the world wide Web,” <i>Computer
    Networks</i>, vol. 31, no. 11–16. Elsevier, pp. 1467–1479, 1999.
  ista: Dean J, Henzinger M. 1999. Finding related pages in the world wide Web. Computer
    Networks. 31(11–16), 1467–1479.
  mla: Dean, Jeffrey, and Monika Henzinger. “Finding Related Pages in the World Wide
    Web.” <i>Computer Networks</i>, vol. 31, no. 11–16, Elsevier, 1999, pp. 1467–79,
    doi:<a href="https://doi.org/10.1016/s1389-1286(99)00022-5">10.1016/s1389-1286(99)00022-5</a>.
  short: J. Dean, M. Henzinger, Computer Networks 31 (1999) 1467–1479.
date_created: 2022-07-29T06:55:26Z
date_published: 1999-05-17T00:00:00Z
date_updated: 2024-11-06T12:08:44Z
day: '17'
doi: 10.1016/s1389-1286(99)00022-5
extern: '1'
intvolume: '        31'
issue: 11-16
keyword:
- Search engines
- Related pages
- Searching paradigms
language:
- iso: eng
month: '05'
oa_version: None
page: 1467-1479
publication: Computer Networks
publication_identifier:
  issn:
  - 1389-1286
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Finding related pages in the world wide Web
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 31
year: '1999'
...
---
_id: '11688'
abstract:
- lang: eng
  text: Recent research has studied how to measure the size of a search engine, in
    terms of the number of pages indexed. In this paper, we consider a different measure
    for search engines, namely the quality of the pages in a search engine index.
    We provide a simple, effective algorithm for approximating the quality of an index
    by performing a random walk on the Web, and we use this methodology to compare
    the index quality of several major search engines.
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 M, Heydon A, Mitzenmacher M, Najork M. Measuring index quality using
    random walks on the web. <i>Computer Networks</i>. 1999;31(11-16):1291-1303. doi:<a
    href="https://doi.org/10.1016/s1389-1286(99)00016-x">10.1016/s1389-1286(99)00016-x</a>
  apa: Henzinger, M., Heydon, A., Mitzenmacher, M., &#38; Najork, M. (1999). Measuring
    index quality using random walks on the web. <i>Computer Networks</i>. Elsevier.
    <a href="https://doi.org/10.1016/s1389-1286(99)00016-x">https://doi.org/10.1016/s1389-1286(99)00016-x</a>
  chicago: Henzinger, Monika, Allan Heydon, Michael Mitzenmacher, and Marc Najork.
    “Measuring Index Quality Using Random Walks on the Web.” <i>Computer Networks</i>.
    Elsevier, 1999. <a href="https://doi.org/10.1016/s1389-1286(99)00016-x">https://doi.org/10.1016/s1389-1286(99)00016-x</a>.
  ieee: M. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork, “Measuring index
    quality using random walks on the web,” <i>Computer Networks</i>, vol. 31, no.
    11–16. Elsevier, pp. 1291–1303, 1999.
  ista: Henzinger M, Heydon A, Mitzenmacher M, Najork M. 1999. Measuring index quality
    using random walks on the web. Computer Networks. 31(11–16), 1291–1303.
  mla: Henzinger, Monika, et al. “Measuring Index Quality Using Random Walks on the
    Web.” <i>Computer Networks</i>, vol. 31, no. 11–16, Elsevier, 1999, pp. 1291–303,
    doi:<a href="https://doi.org/10.1016/s1389-1286(99)00016-x">10.1016/s1389-1286(99)00016-x</a>.
  short: M. Henzinger, A. Heydon, M. Mitzenmacher, M. Najork, Computer Networks 31
    (1999) 1291–1303.
date_created: 2022-07-29T07:00:28Z
date_published: 1999-05-17T00:00:00Z
date_updated: 2024-11-06T08:14:12Z
day: '17'
doi: 10.1016/s1389-1286(99)00016-x
extern: '1'
intvolume: '        31'
issue: 11-16
keyword:
- Search engines
- Index quality
- Random walks
- PageRank
language:
- iso: eng
month: '05'
oa_version: None
page: 1291-1303
publication: Computer Networks
publication_identifier:
  issn:
  - 1389-1286
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Measuring index quality using random walks on the web
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 31
year: '1999'
...
---
_id: '11691'
abstract:
- lang: eng
  text: In this paper we consider the online ftp problem. The goal is to service a
    sequence of file transfer requests given bandwidth constraints of the underlying
    communication network. The main result of the paper is a technique that leads
    to algorithms that optimize several natural metrics, such as max-stretch, total
    flow time, max flow time, and total completion time. In particular, we show how
    to achieve optimum total flow time and optimum max-stretch if we increase the
    capacity of the underlying network by a logarithmic factor. We show that the resource
    augmentation is necessary by proving polynomial lower bounds on the max-stretch
    and total flow time for the case where online and offline algorithms are using
    same-capacity edges. Moreover, we also give polylogarithmic lower bounds on the
    resource augmentation factor necessary in order to keep the total flow time and
    max-stretch within a constant factor of optimum.
article_processing_charge: No
author:
- first_name: Ashish
  full_name: Goel, Ashish
  last_name: Goel
- 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: Serge
  full_name: Plotkin, Serge
  last_name: Plotkin
- first_name: Eva
  full_name: Tardos, Eva
  last_name: Tardos
citation:
  ama: 'Goel A, Henzinger M, Plotkin S, Tardos E. Scheduling data transfers in a network
    and the set scheduling problem. In: <i>Proceedings of the 31st Annual ACM Symposium
    on Theory of Computing</i>. Association for Computing Machinery; 1999:189-197.
    doi:<a href="https://doi.org/10.1145/301250.301300">10.1145/301250.301300</a>'
  apa: 'Goel, A., Henzinger, M., Plotkin, S., &#38; Tardos, E. (1999). Scheduling
    data transfers in a network and the set scheduling problem. In <i>Proceedings
    of the 31st annual ACM symposium on Theory of computing</i> (pp. 189–197).  Atlanta,
    GA, United States: Association for Computing Machinery. <a href="https://doi.org/10.1145/301250.301300">https://doi.org/10.1145/301250.301300</a>'
  chicago: Goel, Ashish, Monika Henzinger, Serge Plotkin, and Eva Tardos. “Scheduling
    Data Transfers in a Network and the Set Scheduling Problem.” In <i>Proceedings
    of the 31st Annual ACM Symposium on Theory of Computing</i>, 189–97. Association
    for Computing Machinery, 1999. <a href="https://doi.org/10.1145/301250.301300">https://doi.org/10.1145/301250.301300</a>.
  ieee: A. Goel, M. Henzinger, S. Plotkin, and E. Tardos, “Scheduling data transfers
    in a network and the set scheduling problem,” in <i>Proceedings of the 31st annual
    ACM symposium on Theory of computing</i>,  Atlanta, GA, United States, 1999, pp.
    189–197.
  ista: 'Goel A, Henzinger M, Plotkin S, Tardos E. 1999. Scheduling data transfers
    in a network and the set scheduling problem. Proceedings of the 31st annual ACM
    symposium on Theory of computing. STOC: Symposium on Theory of Computing, 189–197.'
  mla: Goel, Ashish, et al. “Scheduling Data Transfers in a Network and the Set Scheduling
    Problem.” <i>Proceedings of the 31st Annual ACM Symposium on Theory of Computing</i>,
    Association for Computing Machinery, 1999, pp. 189–97, doi:<a href="https://doi.org/10.1145/301250.301300">10.1145/301250.301300</a>.
  short: A. Goel, M. Henzinger, S. Plotkin, E. Tardos, in:, Proceedings of the 31st
    Annual ACM Symposium on Theory of Computing, Association for Computing Machinery,
    1999, pp. 189–197.
conference:
  end_date: 1999-05-04
  location: ' Atlanta, GA, United States'
  name: 'STOC: Symposium on Theory of Computing'
  start_date: 1999-05-01
date_created: 2022-07-29T07:43:00Z
date_published: 1999-05-01T00:00:00Z
date_updated: 2024-11-06T12:08:56Z
day: '01'
doi: 10.1145/301250.301300
extern: '1'
keyword:
- Scheduling
- Flow time
language:
- iso: eng
month: '05'
oa_version: None
page: 189-197
publication: Proceedings of the 31st annual ACM symposium on Theory of computing
publication_identifier:
  issn:
  - 0196-6774
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Scheduling data transfers in a network and the set scheduling problem
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '1999'
...
---
_id: '11769'
abstract:
- lang: eng
  text: "This paper solves a longstanding open problem in fully dynamic algorithms:
    We present the first fully dynamic algorithms that maintain connectivity, bipartiteness,
    and approximate minimum spanning trees in polylogarithmic time per edge insertion
    or deletion. The algorithms are designed using a new dynamic technique that combines
    a novel graph decomposition with randomization. They are Las-Vegas type randomized
    algorithms which use simple data structures and have a small constant factor.\r\nLet
    n denote the number of nodes in the graph. For a sequence of Ω(m0) operations,
    where m0 is the number of edges in the initial graph, the expected time for p
    updates is O(p log3 n) (througout the paper the logarithms are based 2) for connectivity
    and bipartiteness. The worst-case time for one query is O(log n/log log n). For
    the k-edge witness problem (“Does the removal of k given edges disconnect the
    graph?”) the expected time for p updates is O(p log3 n) and the expected time
    for q queries is O(qk log3 n). Given a graph with k different weights, the minimum
    spanning tree can be maintained during a sequence of p updates in expected time
    O(pk log3 n). This implies an algorithm to maintain a 1 + ε-approximation of the
    minimum spanning tree in expected time O((p log3 n logU)/ε) for p updates, where
    the weights of the edges are between 1 and U."
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: Valerie
  full_name: King, Valerie
  last_name: King
citation:
  ama: Henzinger M, King V. Randomized fully dynamic graph algorithms with polylogarithmic
    time per operation. <i>Journal of the ACM</i>. 1999;46(4):502-516. doi:<a href="https://doi.org/10.1145/320211.320215">10.1145/320211.320215</a>
  apa: Henzinger, M., &#38; King, V. (1999). Randomized fully dynamic graph algorithms
    with polylogarithmic time per operation. <i>Journal of the ACM</i>. Association
    for Computing Machinery. <a href="https://doi.org/10.1145/320211.320215">https://doi.org/10.1145/320211.320215</a>
  chicago: Henzinger, Monika, and Valerie King. “Randomized Fully Dynamic Graph Algorithms
    with Polylogarithmic Time per Operation.” <i>Journal of the ACM</i>. Association
    for Computing Machinery, 1999. <a href="https://doi.org/10.1145/320211.320215">https://doi.org/10.1145/320211.320215</a>.
  ieee: M. Henzinger and V. King, “Randomized fully dynamic graph algorithms with
    polylogarithmic time per operation,” <i>Journal of the ACM</i>, vol. 46, no. 4.
    Association for Computing Machinery, pp. 502–516, 1999.
  ista: Henzinger M, King V. 1999. Randomized fully dynamic graph algorithms with
    polylogarithmic time per operation. Journal of the ACM. 46(4), 502–516.
  mla: Henzinger, Monika, and Valerie King. “Randomized Fully Dynamic Graph Algorithms
    with Polylogarithmic Time per Operation.” <i>Journal of the ACM</i>, vol. 46,
    no. 4, Association for Computing Machinery, 1999, pp. 502–16, doi:<a href="https://doi.org/10.1145/320211.320215">10.1145/320211.320215</a>.
  short: M. Henzinger, V. King, Journal of the ACM 46 (1999) 502–516.
date_created: 2022-08-08T12:50:25Z
date_published: 1999-07-01T00:00:00Z
date_updated: 2024-11-06T08:15:30Z
day: '01'
doi: 10.1145/320211.320215
extern: '1'
intvolume: '        46'
issue: '4'
language:
- iso: eng
month: '07'
oa_version: None
page: 502-516
publication: Journal of the ACM
publication_identifier:
  eissn:
  - 1557-735X
  issn:
  - 0004-5411
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Randomized fully dynamic graph algorithms with polylogarithmic time per operation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 46
year: '1999'
...
---
_id: '11895'
abstract:
- lang: eng
  text: In this paper we present an analysis of an AltaVista Search Engine query log
    consisting of approximately 1 billion entries for search requests over a period
    of six weeks. This represents almost 285 million user sessions, each an attempt
    to fill a single information need. We present an analysis of individual queries,
    query duplication, and query sessions. We also present results of a correlation
    analysis of the log entries, studying the interaction of terms within queries.
    Our data supports the conjecture that web users differ significantly from the
    user assumed in the standard information retrieval literature. Specifically, we
    show that web users type in short queries, mostly look at the first 10 results
    only, and seldom modify the query. This suggests that traditional information
    retrieval techniques may not work well for answering web search requests. The
    correlation analysis showed that the most highly correlated items are constituents
    of phrases. This result indicates it may be useful for search engines to consider
    search terms as parts of phrases even if the user did not explicitly specify them
    as such.
article_processing_charge: No
article_type: original
author:
- first_name: Craig
  full_name: Silverstein, Craig
  last_name: Silverstein
- first_name: Hannes
  full_name: Marais, Hannes
  last_name: Marais
- 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: Michael
  full_name: Moricz, Michael
  last_name: Moricz
citation:
  ama: Silverstein C, Marais H, Henzinger M, Moricz M. Analysis of a very large web
    search engine query log. <i>ACM SIGIR Forum</i>. 1999;33(1):6-12. doi:<a href="https://doi.org/10.1145/331403.331405">10.1145/331403.331405</a>
  apa: Silverstein, C., Marais, H., Henzinger, M., &#38; Moricz, M. (1999). Analysis
    of a very large web search engine query log. <i>ACM SIGIR Forum</i>. Association
    for Computing Machinery. <a href="https://doi.org/10.1145/331403.331405">https://doi.org/10.1145/331403.331405</a>
  chicago: Silverstein, Craig, Hannes Marais, Monika Henzinger, and Michael Moricz.
    “Analysis of a Very Large Web Search Engine Query Log.” <i>ACM SIGIR Forum</i>.
    Association for Computing Machinery, 1999. <a href="https://doi.org/10.1145/331403.331405">https://doi.org/10.1145/331403.331405</a>.
  ieee: C. Silverstein, H. Marais, M. Henzinger, and M. Moricz, “Analysis of a very
    large web search engine query log,” <i>ACM SIGIR Forum</i>, vol. 33, no. 1. Association
    for Computing Machinery, pp. 6–12, 1999.
  ista: Silverstein C, Marais H, Henzinger M, Moricz M. 1999. Analysis of a very large
    web search engine query log. ACM SIGIR Forum. 33(1), 6–12.
  mla: Silverstein, Craig, et al. “Analysis of a Very Large Web Search Engine Query
    Log.” <i>ACM SIGIR Forum</i>, vol. 33, no. 1, Association for Computing Machinery,
    1999, pp. 6–12, doi:<a href="https://doi.org/10.1145/331403.331405">10.1145/331403.331405</a>.
  short: C. Silverstein, H. Marais, M. Henzinger, M. Moricz, ACM SIGIR Forum 33 (1999)
    6–12.
date_created: 2022-08-17T08:53:02Z
date_published: 1999-01-01T00:00:00Z
date_updated: 2024-11-06T12:23:26Z
day: '01'
doi: 10.1145/331403.331405
extern: '1'
intvolume: '        33'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1145/331403.331405
month: '01'
oa: 1
oa_version: Published Version
page: 6-12
publication: ACM SIGIR Forum
publication_identifier:
  issn:
  - 0163-5840
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Analysis of a very large web search engine query log
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '1999'
...
---
_id: '11925'
abstract:
- lang: eng
  text: "This paper studies the multicast routing and admission control problem on
    unit-capacity tree and mesh topologies in the throughput-model. The problem is
    a generalization of the edge-disjoint paths problem and is NPhard both on trees
    and meshes. We study both the offline and the online version of the problem: In
    the offline setting, we give the first\r\nconstant-factor approximation algorithm
    for trees, and an O((log log n)*)-factor approximation algorithm for meshes, where
    n is the number of nodes in the graph. In the online setting, we give the first
    polylogarithrnic competitive online algorithm for tree and mesh topologies. No
    polylogarithmic-competitive algorithm is possible on general network topologies
    [8] and there\r\nexists a polylogarithmic lower bound on the competitive ratio
    of any online algorithm on tree topologies [l]. We prove the same lower bound
    for meshes. "
article_processing_charge: No
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: Stefano
  full_name: Leonardi   , Stefano
  last_name: 'Leonardi   '
citation:
  ama: 'Henzinger M, Leonardi    S. Scheduling multicasts on unit-capacity trees and
    meshes. In: <i>10th Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society
    for Industrial &#38; Applied Mathematics; 1999:438-447.'
  apa: 'Henzinger, M., &#38; Leonardi   , S. (1999). Scheduling multicasts on unit-capacity
    trees and meshes. In <i>10th Annual ACM-SIAM Symposium on Discrete Algorithms</i>
    (pp. 438–447). Baltimore, MD, United States: Society for Industrial &#38; Applied
    Mathematics.'
  chicago: Henzinger, Monika, and Stefano Leonardi   . “Scheduling Multicasts on Unit-Capacity
    Trees and Meshes.” In <i>10th Annual ACM-SIAM Symposium on Discrete Algorithms</i>,
    438–47. Society for Industrial &#38; Applied Mathematics, 1999.
  ieee: M. Henzinger and S. Leonardi   , “Scheduling multicasts on unit-capacity trees
    and meshes,” in <i>10th Annual ACM-SIAM Symposium on Discrete Algorithms</i>,
    Baltimore, MD, United States, 1999, pp. 438–447.
  ista: 'Henzinger M, Leonardi    S. 1999. Scheduling multicasts on unit-capacity
    trees and meshes. 10th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA:
    Symposium on Discrete Algorithms, 438–447.'
  mla: Henzinger, Monika, and Stefano Leonardi   . “Scheduling Multicasts on Unit-Capacity
    Trees and Meshes.” <i>10th Annual ACM-SIAM Symposium on Discrete Algorithms</i>,
    Society for Industrial &#38; Applied Mathematics, 1999, pp. 438–47.
  short: M. Henzinger, S. Leonardi   , in:, 10th Annual ACM-SIAM Symposium on Discrete
    Algorithms, Society for Industrial &#38; Applied Mathematics, 1999, pp. 438–447.
conference:
  end_date: 1999-01-19
  location: Baltimore, MD, United States
  name: 'SODA: Symposium on Discrete Algorithms'
  start_date: 1999-01-17
date_created: 2022-08-18T12:45:50Z
date_published: 1999-01-01T00:00:00Z
date_updated: 2024-11-06T12:00:31Z
day: '01'
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 438-447
publication: 10th Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
  isbn:
  - '0898714346'
publication_status: published
publisher: Society for Industrial & Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Scheduling multicasts on unit-capacity trees and meshes
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '1999'
...
---
_id: '2711'
abstract:
- lang: eng
  text: We study the long time evolution of a quantum particle in a Gaussian random
    environment. We show that in the weak coupling limit the Wigner distribution of
    the wave function converges to the solution of a linear Boltzmann equation globally
    in time. The Boltzmann collision kernel is given by the Born approximation of
    the quantum scattering cross section.
alternative_title:
- 'Operator Theory: Advances and Applications'
article_processing_charge: No
author:
- first_name: László
  full_name: Erdös, László
  id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
  last_name: Erdös
  orcid: 0000-0001-5366-9603
citation:
  ama: 'Erdös L. Linear Boltzmann equation as the weak coupling limit of the random
    Schrödinger equation. In: <i>Proceedings of the 7th QMath Conference</i>. Vol
    108. World Scientific Publishing; 1999:233-242. doi:<a href="https://doi.org/10.1007/978-3-0348-8745-8_20">10.1007/978-3-0348-8745-8_20</a>'
  apa: 'Erdös, L. (1999). Linear Boltzmann equation as the weak coupling limit of
    the random Schrödinger equation. In <i>Proceedings of the 7th QMath Conference</i>
    (Vol. 108, pp. 233–242). Prague, Czech Republik: World Scientific Publishing.
    <a href="https://doi.org/10.1007/978-3-0348-8745-8_20">https://doi.org/10.1007/978-3-0348-8745-8_20</a>'
  chicago: Erdös, László. “Linear Boltzmann Equation as the Weak Coupling Limit of
    the Random Schrödinger Equation.” In <i>Proceedings of the 7th QMath Conference</i>,
    108:233–42. World Scientific Publishing, 1999. <a href="https://doi.org/10.1007/978-3-0348-8745-8_20">https://doi.org/10.1007/978-3-0348-8745-8_20</a>.
  ieee: L. Erdös, “Linear Boltzmann equation as the weak coupling limit of the random
    Schrödinger equation,” in <i>Proceedings of the 7th QMath Conference</i>, Prague,
    Czech Republik, 1999, vol. 108, pp. 233–242.
  ista: 'Erdös L. 1999. Linear Boltzmann equation as the weak coupling limit of the
    random Schrödinger equation. Proceedings of the 7th QMath Conference. QMath: Mathematical
    Results in Quantum Physics, Operator Theory: Advances and Applications, vol. 108,
    233–242.'
  mla: Erdös, László. “Linear Boltzmann Equation as the Weak Coupling Limit of the
    Random Schrödinger Equation.” <i>Proceedings of the 7th QMath Conference</i>,
    vol. 108, World Scientific Publishing, 1999, pp. 233–42, doi:<a href="https://doi.org/10.1007/978-3-0348-8745-8_20">10.1007/978-3-0348-8745-8_20</a>.
  short: L. Erdös, in:, Proceedings of the 7th QMath Conference, World Scientific
    Publishing, 1999, pp. 233–242.
conference:
  end_date: 1999-09-26
  location: Prague, Czech Republik
  name: 'QMath: Mathematical Results in Quantum Physics'
  start_date: 1998-06-22
date_created: 2018-12-11T11:59:12Z
date_published: 1999-01-01T00:00:00Z
date_updated: 2022-09-13T08:02:52Z
day: '01'
doi: 10.1007/978-3-0348-8745-8_20
extern: '1'
intvolume: '       108'
language:
- iso: eng
month: '01'
oa_version: None
page: 233 - 242
publication: Proceedings of the 7th QMath Conference
publication_identifier:
  isbn:
  - '9783034897549'
publication_status: published
publisher: World Scientific Publishing
publist_id: '4185'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Linear Boltzmann equation as the weak coupling limit of the random Schrödinger
  equation
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 108
year: '1999'
...
---
_id: '2730'
abstract:
- lang: eng
  text: We give the leading order semiclassical asymptotics for the sum of the negative
    eigenvalues of the Pauli operator (in dimension two and three) with a strong non-homogeneous
    magnetic field. This result can be used to prove that the magnetic Thomas-Fermi
    theory gives the leading order ground state energy of large atoms. We develop
    a new localization scheme well suited to the anisotropic character of the strong
    magnetic field. We also use the basic Lieb-Thirring estimate obtained earlier
    (1996). (orig.) 19 refs.
acknowledgement: The first author gratefully acknowledges financial support from the
  Eidgen6ssiche Technische Hochschule, Forschungsinstitut für Mathematik, Zürich,
  where this work was started. He is also grateful for the hospitality and support
  of Aarhus University during his visits there.
article_processing_charge: No
article_type: original
author:
- first_name: László
  full_name: Erdös, László
  id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
  last_name: Erdös
  orcid: 0000-0001-5366-9603
- first_name: Jan
  full_name: Solovej, Jan
  last_name: Solovej
citation:
  ama: 'Erdös L, Solovej J. Semiclassical eigenvalue estimates for the Pauli operator
    with strong nonhomogeneous magnetic fields, I: Nonasymptotic Lieb-Thirring-type
    estimate. <i>Duke Mathematical Journal</i>. 1999;96(1):127-173. doi:<a href="https://doi.org/10.1215/S0012-7094-99-09604-7">10.1215/S0012-7094-99-09604-7</a>'
  apa: 'Erdös, L., &#38; Solovej, J. (1999). Semiclassical eigenvalue estimates for
    the Pauli operator with strong nonhomogeneous magnetic fields, I: Nonasymptotic
    Lieb-Thirring-type estimate. <i>Duke Mathematical Journal</i>. Duke University
    Press. <a href="https://doi.org/10.1215/S0012-7094-99-09604-7">https://doi.org/10.1215/S0012-7094-99-09604-7</a>'
  chicago: 'Erdös, László, and Jan Solovej. “Semiclassical Eigenvalue Estimates for
    the Pauli Operator with Strong Nonhomogeneous Magnetic Fields, I: Nonasymptotic
    Lieb-Thirring-Type Estimate.” <i>Duke Mathematical Journal</i>. Duke University
    Press, 1999. <a href="https://doi.org/10.1215/S0012-7094-99-09604-7">https://doi.org/10.1215/S0012-7094-99-09604-7</a>.'
  ieee: 'L. Erdös and J. Solovej, “Semiclassical eigenvalue estimates for the Pauli
    operator with strong nonhomogeneous magnetic fields, I: Nonasymptotic Lieb-Thirring-type
    estimate,” <i>Duke Mathematical Journal</i>, vol. 96, no. 1. Duke University Press,
    pp. 127–173, 1999.'
  ista: 'Erdös L, Solovej J. 1999. Semiclassical eigenvalue estimates for the Pauli
    operator with strong nonhomogeneous magnetic fields, I: Nonasymptotic Lieb-Thirring-type
    estimate. Duke Mathematical Journal. 96(1), 127–173.'
  mla: 'Erdös, László, and Jan Solovej. “Semiclassical Eigenvalue Estimates for the
    Pauli Operator with Strong Nonhomogeneous Magnetic Fields, I: Nonasymptotic Lieb-Thirring-Type
    Estimate.” <i>Duke Mathematical Journal</i>, vol. 96, no. 1, Duke University Press,
    1999, pp. 127–73, doi:<a href="https://doi.org/10.1215/S0012-7094-99-09604-7">10.1215/S0012-7094-99-09604-7</a>.'
  short: L. Erdös, J. Solovej, Duke Mathematical Journal 96 (1999) 127–173.
corr_author: '1'
date_created: 2018-12-11T11:59:18Z
date_published: 1999-01-15T00:00:00Z
date_updated: 2024-10-09T20:53:53Z
day: '15'
doi: 10.1215/S0012-7094-99-09604-7
extern: '1'
intvolume: '        96'
issue: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 127 - 173
publication: Duke Mathematical Journal
publication_identifier:
  issn:
  - 0012-7094
publication_status: published
publisher: Duke University Press
publist_id: '4162'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Semiclassical eigenvalue estimates for the Pauli operator with strong nonhomogeneous
  magnetic fields, I: Nonasymptotic Lieb-Thirring-type estimate'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 96
year: '1999'
...
---
_id: '2783'
abstract:
- lang: eng
  text: Pattern formation in a layer of fluid heated from below is an example of macroscopic
    ordering in continuous media. Here we show that in a relatively compact experimental
    version of the problem, a rich and diverse set of stable flows can be found. These
    flows, many of which are novel, can be categorized and understood in terms of
    their symmetry properties. This approach shows promise for providing insight into
    the more complicated fluid motion that occurs as the lateral dimension of the
    layer is increased.
article_processing_charge: No
article_type: original
author:
- first_name: Björn
  full_name: Hof, Björn
  id: 3A374330-F248-11E8-B48F-1D18A9856A87
  last_name: Hof
  orcid: 0000-0003-2057-2754
- first_name: Peter
  full_name: Lucas, Peter
  last_name: Lucas
- first_name: Tom
  full_name: Mullin, Tom
  last_name: Mullin
citation:
  ama: Hof B, Lucas P, Mullin T. Flow state multiplicity in convection. <i>Physics
    of Fluids</i>. 1999;11(10):2815-2817. doi:<a href="https://doi.org/10.1063/1.870178
    ">10.1063/1.870178 </a>
  apa: Hof, B., Lucas, P., &#38; Mullin, T. (1999). Flow state multiplicity in convection.
    <i>Physics of Fluids</i>. American Institute of Physics. <a href="https://doi.org/10.1063/1.870178
    ">https://doi.org/10.1063/1.870178 </a>
  chicago: Hof, Björn, Peter Lucas, and Tom Mullin. “Flow State Multiplicity in Convection.”
    <i>Physics of Fluids</i>. American Institute of Physics, 1999. <a href="https://doi.org/10.1063/1.870178
    ">https://doi.org/10.1063/1.870178 </a>.
  ieee: B. Hof, P. Lucas, and T. Mullin, “Flow state multiplicity in convection,”
    <i>Physics of Fluids</i>, vol. 11, no. 10. American Institute of Physics, pp.
    2815–2817, 1999.
  ista: Hof B, Lucas P, Mullin T. 1999. Flow state multiplicity in convection. Physics
    of Fluids. 11(10), 2815–2817.
  mla: Hof, Björn, et al. “Flow State Multiplicity in Convection.” <i>Physics of Fluids</i>,
    vol. 11, no. 10, American Institute of Physics, 1999, pp. 2815–17, doi:<a href="https://doi.org/10.1063/1.870178
    ">10.1063/1.870178 </a>.
  short: B. Hof, P. Lucas, T. Mullin, Physics of Fluids 11 (1999) 2815–2817.
date_created: 2018-12-11T11:59:34Z
date_published: 1999-10-01T00:00:00Z
date_updated: 2022-09-09T09:24:10Z
day: '01'
doi: '10.1063/1.870178 '
extern: '1'
intvolume: '        11'
issue: '10'
language:
- iso: eng
month: '10'
oa_version: None
page: 2815 - 2817
publication: Physics of Fluids
publication_identifier:
  issn:
  - 0031-9171
publication_status: published
publisher: American Institute of Physics
publist_id: '4106'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Flow state multiplicity in convection
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 11
year: '1999'
...
---
_id: '2864'
abstract:
- lang: eng
  text: Using an electrospray tandem mass spectrometer as a concentration-sensitive
    detector, a method has been developed to quantify femtomole amounts of plant growth
    regulators (i.e. isoprenoid type cytokinins, zeatin, dihydrozeatin, isopentenyladenine
    and their respective riboside and glucoside analogues) and the second messenger
    adenosine 3':5'-cyclic monophosphate (3':5'-cAMP). Miniaturisation of the chromatographic
    setup using capillary high performance liquid chromatographic (HPLC) ion spray
    mass spectrometry increased the sensitivity to the low femtomole region. Application
    of automated capillary column switching allowed the introduction of large injection
    volumes into the HPLC system. Aliquots (25 μL) were injected into one dimension
    of the HPLC set-up and stacked onto a micro pre-column. By means of mobile phase
    switching the pre-column was back-flushed to introduce the analytes onto the analytical
    column. For cytokinin analysis positive electrospray ionisation was used and resulted
    in 2.5-25 fmol detection limits. Cyclic nucleotides were separated under ion-pair
    conditions using tetrabutyl ammonium bromide as ion-pair reagent and were detected
    under negative electrospray ionisation conditions. Here a 25 fmol detection limit
    was determined. Following this approach, cytokinins and 3':5'-cAMP extracted from
    only mg amounts of apical shoot meristem and chloroplasts obtained from Nicotiana
    tabacum cv. Petit Havana SR1 were identified and quantified.
acknowledgement: The  authors  wish  to  thank  J.  Dupon  for  technical  and  logisticalassistance.
  The authors also wish to thank the FWO-Vlaanderen/lotto (grant  32013394),  the  Flemish  government  (GOA-action)  and  the
  Grant Agency of the Czech Republic (grant 206/96/K188) for financial support.
article_processing_charge: No
article_type: original
author:
- first_name: Erwin
  full_name: Witters, Erwin
  last_name: Witters
- first_name: Koen
  full_name: Vanhoutte, Koen
  last_name: Vanhoutte
- first_name: Walter
  full_name: Dewitte, Walter
  last_name: Dewitte
- first_name: Ivana
  full_name: Macháčková, Ivana
  last_name: Macháčková
- first_name: Eva
  full_name: Benková, Eva
  id: 38F4F166-F248-11E8-B48F-1D18A9856A87
  last_name: Benková
  orcid: 0000-0002-8510-9739
- first_name: Walter
  full_name: Van Dongen, Walter
  last_name: Van Dongen
- first_name: Eddy
  full_name: Esmans, Eddy
  last_name: Esmans
- first_name: Henri
  full_name: Van Onckelen, Henri
  last_name: Van Onckelen
citation:
  ama: Witters E, Vanhoutte K, Dewitte W, et al. Analysis of cyclic nucleotides and
    cytokinins in minute plant samples using phase system switching capillary electrospray
    liquid chromatography tandem mass spectrometry. <i>Phytochemical Analysis</i>.
    1999;10(3):143-151. doi:<a href="https://doi.org/10.1002/(SICI)1099-1565(199905/06)10:3&#38;lt;143::AID-PCA441&#38;gt;3.0.CO;2-G">10.1002/(SICI)1099-1565(199905/06)10:3&#38;lt;143::AID-PCA441&#38;gt;3.0.CO;2-G</a>
  apa: Witters, E., Vanhoutte, K., Dewitte, W., Macháčková, I., Benková, E., Van Dongen,
    W., … Van Onckelen, H. (1999). Analysis of cyclic nucleotides and cytokinins in
    minute plant samples using phase system switching capillary electrospray liquid
    chromatography tandem mass spectrometry. <i>Phytochemical Analysis</i>. Wiley-Blackwell.
    <a href="https://doi.org/10.1002/(SICI)1099-1565(199905/06)10:3&#38;lt;143::AID-PCA441&#38;gt;3.0.CO;2-G">https://doi.org/10.1002/(SICI)1099-1565(199905/06)10:3&#38;lt;143::AID-PCA441&#38;gt;3.0.CO;2-G</a>
  chicago: Witters, Erwin, Koen Vanhoutte, Walter Dewitte, Ivana Macháčková, Eva Benková,
    Walter Van Dongen, Eddy Esmans, and Henri Van Onckelen. “Analysis of Cyclic Nucleotides
    and Cytokinins in Minute Plant Samples Using Phase System Switching Capillary
    Electrospray Liquid Chromatography Tandem Mass Spectrometry.” <i>Phytochemical
    Analysis</i>. Wiley-Blackwell, 1999. <a href="https://doi.org/10.1002/(SICI)1099-1565(199905/06)10:3&#38;lt;143::AID-PCA441&#38;gt;3.0.CO;2-G">https://doi.org/10.1002/(SICI)1099-1565(199905/06)10:3&#38;lt;143::AID-PCA441&#38;gt;3.0.CO;2-G</a>.
  ieee: E. Witters <i>et al.</i>, “Analysis of cyclic nucleotides and cytokinins in
    minute plant samples using phase system switching capillary electrospray liquid
    chromatography tandem mass spectrometry,” <i>Phytochemical Analysis</i>, vol.
    10, no. 3. Wiley-Blackwell, pp. 143–151, 1999.
  ista: Witters E, Vanhoutte K, Dewitte W, Macháčková I, Benková E, Van Dongen W,
    Esmans E, Van Onckelen H. 1999. Analysis of cyclic nucleotides and cytokinins
    in minute plant samples using phase system switching capillary electrospray liquid
    chromatography tandem mass spectrometry. Phytochemical Analysis. 10(3), 143–151.
  mla: Witters, Erwin, et al. “Analysis of Cyclic Nucleotides and Cytokinins in Minute
    Plant Samples Using Phase System Switching Capillary Electrospray Liquid Chromatography
    Tandem Mass Spectrometry.” <i>Phytochemical Analysis</i>, vol. 10, no. 3, Wiley-Blackwell,
    1999, pp. 143–51, doi:<a href="https://doi.org/10.1002/(SICI)1099-1565(199905/06)10:3&#38;lt;143::AID-PCA441&#38;gt;3.0.CO;2-G">10.1002/(SICI)1099-1565(199905/06)10:3&#38;lt;143::AID-PCA441&#38;gt;3.0.CO;2-G</a>.
  short: E. Witters, K. Vanhoutte, W. Dewitte, I. Macháčková, E. Benková, W. Van Dongen,
    E. Esmans, H. Van Onckelen, Phytochemical Analysis 10 (1999) 143–151.
date_created: 2018-12-11T12:00:00Z
date_published: 1999-05-01T00:00:00Z
date_updated: 2022-09-09T09:09:22Z
day: '01'
doi: 10.1002/(SICI)1099-1565(199905/06)10:3&lt;143::AID-PCA441&gt;3.0.CO;2-G
extern: '1'
intvolume: '        10'
issue: '3'
language:
- iso: eng
month: '05'
oa_version: None
page: 143 - 151
publication: Phytochemical Analysis
publication_identifier:
  issn:
  - 0958-0344
publication_status: published
publisher: Wiley-Blackwell
publist_id: '3925'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Analysis of cyclic nucleotides and cytokinins in minute plant samples using
  phase system switching capillary electrospray liquid chromatography tandem mass
  spectrometry
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 10
year: '1999'
...
---
OA_place: repository
OA_type: green
_id: '2865'
abstract:
- lang: eng
  text: 'Although cytokinins (CKs) affect a number of processes connected with chloroplasts,
    it has never been rigorously proven that chloroplasts contain CKs. We isolated
    intact chloroplasts from tobacco (Nicotiana tabacum L. cv SR1) and wheat (Triticum
    aestivum L. cv Ritmo) leaves and determined their CKs by liquid chromatography/tandem
    mass spectroscopy. Chloroplasts from both species contained a whole spectrum of
    CKs, including free bases (zeatin and isopentenyladenine), ribosides (zeatin riboside,
    and isopentenyladenosine), ribotides (isopentenyladenosine-5′-monophosphate, zeatin
    riboside-5′-monophosphate, and dihydrozeatin riboside-5′-monophosphate), and N-glucosides
    (zeatin-N 9-glucoside, dihydrozeatin-N 9-glucoside, zeatin-N 7-glucoside, and
    isopentenyladenine-N-glucosides). In chloroplasts there was a moderately higher
    relative amount of bases, ribosides, and ribotides than in leaves, and a significantly
    increased level ofN 9-glucosides of zeatin and dihydrozeatin. Tobacco and wheat
    chloroplasts were prepared from leaves at the end of either a dark or light period.
    After a dark period, chloroplasts accumulated more CKs than after a light period.
    The differences were moderate for free bases and ribosides, but highly significant
    for glucosides. Tobacco chloroplasts from dark-treated leaves contained zeatin
    riboside-O-glucoside and dihydrozeatin riboside-O-glucoside, as well as a relatively
    high CK oxidase activity. These data show that chloroplasts contain a whole spectrum
    of CKs and the enzymatic activity necessary for their metabolism. '
acknowledgement: The authors thank Prof. Dennis Baker (Wye College, London) and Dr.
  Laura Zonia (Institute of Experimental Botany, Prague) for language correction of
  the manuscript and Prof. Miroslav Kamínek (Institute of Experimental Botany, Prague)
  for critical reading of the manuscript.
article_processing_charge: No
article_type: original
author:
- first_name: Eva
  full_name: Benková, Eva
  id: 38F4F166-F248-11E8-B48F-1D18A9856A87
  last_name: Benková
  orcid: 0000-0002-8510-9739
- first_name: Erwin
  full_name: Witters, Erwin
  last_name: Witters
- first_name: Walter
  full_name: Van Dongen, Walter
  last_name: Van Dongen
- first_name: Jan
  full_name: Kolář, Jan
  last_name: Kolář
- first_name: Václav
  full_name: Motyka, Václav
  last_name: Motyka
- first_name: Břetislav
  full_name: Brzobohatý, Břetislav
  last_name: Brzobohatý
- first_name: Henri
  full_name: Van Onckelen, Henri
  last_name: Van Onckelen
- first_name: Ivana
  full_name: Macháčková, Ivana
  last_name: Macháčková
citation:
  ama: Benková E, Witters E, Van Dongen W, et al. Cytokinins in tobacco and wheat
    chloroplasts. Occurrence and changes due to light/dark treatment. <i>Plant Physiology</i>.
    1999;121(1):245-251. doi:<a href="https://doi.org/10.1104/pp.121.1.245">10.1104/pp.121.1.245</a>
  apa: Benková, E., Witters, E., Van Dongen, W., Kolář, J., Motyka, V., Brzobohatý,
    B., … Macháčková, I. (1999). Cytokinins in tobacco and wheat chloroplasts. Occurrence
    and changes due to light/dark treatment. <i>Plant Physiology</i>. American Society
    of Plant Biologists. <a href="https://doi.org/10.1104/pp.121.1.245">https://doi.org/10.1104/pp.121.1.245</a>
  chicago: Benková, Eva, Erwin Witters, Walter Van Dongen, Jan Kolář, Václav Motyka,
    Břetislav Brzobohatý, Henri Van Onckelen, and Ivana Macháčková. “Cytokinins in
    Tobacco and Wheat Chloroplasts. Occurrence and Changes Due to Light/Dark Treatment.”
    <i>Plant Physiology</i>. American Society of Plant Biologists, 1999. <a href="https://doi.org/10.1104/pp.121.1.245">https://doi.org/10.1104/pp.121.1.245</a>.
  ieee: E. Benková <i>et al.</i>, “Cytokinins in tobacco and wheat chloroplasts. Occurrence
    and changes due to light/dark treatment,” <i>Plant Physiology</i>, vol. 121, no.
    1. American Society of Plant Biologists, pp. 245–251, 1999.
  ista: Benková E, Witters E, Van Dongen W, Kolář J, Motyka V, Brzobohatý B, Van Onckelen
    H, Macháčková I. 1999. Cytokinins in tobacco and wheat chloroplasts. Occurrence
    and changes due to light/dark treatment. Plant Physiology. 121(1), 245–251.
  mla: Benková, Eva, et al. “Cytokinins in Tobacco and Wheat Chloroplasts. Occurrence
    and Changes Due to Light/Dark Treatment.” <i>Plant Physiology</i>, vol. 121, no.
    1, American Society of Plant Biologists, 1999, pp. 245–51, doi:<a href="https://doi.org/10.1104/pp.121.1.245">10.1104/pp.121.1.245</a>.
  short: E. Benková, E. Witters, W. Van Dongen, J. Kolář, V. Motyka, B. Brzobohatý,
    H. Van Onckelen, I. Macháčková, Plant Physiology 121 (1999) 245–251.
date_created: 2018-12-11T12:00:00Z
date_published: 1999-09-01T00:00:00Z
date_updated: 2025-06-26T08:49:10Z
day: '01'
doi: 10.1104/pp.121.1.245
extern: '1'
external_id:
  pmid:
  - '10482680'
intvolume: '       121'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC59373/
month: '09'
oa: 1
oa_version: Published Version
page: 245 - 251
pmid: 1
publication: Plant Physiology
publication_identifier:
  issn:
  - 0032-0889
publication_status: published
publisher: American Society of Plant Biologists
publist_id: '3924'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Cytokinins in tobacco and wheat chloroplasts. Occurrence and changes due to
  light/dark treatment
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 121
year: '1999'
...
---
_id: '3137'
abstract:
- lang: eng
  text: This volume provides an overview of glutamate receptors and their role in
    excitatory neurotransmission. It focusses on three aspects. First, it describes
    the functional, molecular, and pharmacological properties of glutamate receptors
    (AMPA, NMDA, and kainate receptors). Second, it gives a survey how these receptors
    are involved in synaptic transmission at different glutamatergic synapses in the
    mammalian CNS. Finally, it adresses how overactivation of glutamate receptors
    can lead to excitotoxic cell death, and emphasizes the importance of glutamate
    receptors as potential therapeutical targets. The chapters, written by leading
    scientists, give accurate summaries of facets that have emerged recently in this
    field. The book demonstrates the strength of a multidisciplinary approach involving
    physiology, pharmacology, and molecular biology. It will be useful for other scientists
    in and outside the field, lecturers and students at different educational levels.
alternative_title:
- Handbook of Experimental Pharmacology
article_processing_charge: No
citation:
  ama: 'Jonas PM, Monyer H, eds. <i>Ionotropic Glutamate Receptors in the CNS</i>.
    Vol 141. 1st ed. Berlin ; Heidelberg: Springer; 1999. doi:<a href="https://doi.org/10.1007/978-3-662-08022-1">10.1007/978-3-662-08022-1</a>'
  apa: 'Jonas, P. M., &#38; Monyer, H. (Eds.). (1999). <i>Ionotropic Glutamate Receptors
    in the CNS</i> (1st ed., Vol. 141). Berlin ; Heidelberg: Springer. <a href="https://doi.org/10.1007/978-3-662-08022-1">https://doi.org/10.1007/978-3-662-08022-1</a>'
  chicago: 'Jonas, Peter M, and Hannah Monyer, eds. <i>Ionotropic Glutamate Receptors
    in the CNS</i>. 1st ed. Vol. 141. Berlin ; Heidelberg: Springer, 1999. <a href="https://doi.org/10.1007/978-3-662-08022-1">https://doi.org/10.1007/978-3-662-08022-1</a>.'
  ieee: 'P. M. Jonas and H. Monyer, Eds., <i>Ionotropic Glutamate Receptors in the
    CNS</i>, 1st ed., vol. 141. Berlin ; Heidelberg: Springer, 1999.'
  ista: 'Jonas PM, Monyer H eds. 1999. Ionotropic Glutamate Receptors in the CNS 1st
    ed., Berlin ; Heidelberg: Springer, XXII, 535p.'
  mla: Jonas, Peter M., and Hannah Monyer, editors. <i>Ionotropic Glutamate Receptors
    in the CNS</i>. 1st ed., vol. 141, Springer, 1999, doi:<a href="https://doi.org/10.1007/978-3-662-08022-1">10.1007/978-3-662-08022-1</a>.
  short: P.M. Jonas, H. Monyer, eds., Ionotropic Glutamate Receptors in the CNS, 1st
    ed., Springer, Berlin ; Heidelberg, 1999.
date_created: 2018-12-11T12:01:36Z
date_published: 1999-01-01T00:00:00Z
date_updated: 2021-12-22T11:13:43Z
day: '01'
doi: 10.1007/978-3-662-08022-1
edition: '1'
editor:
- first_name: Peter M
  full_name: Jonas, Peter M
  id: 353C1B58-F248-11E8-B48F-1D18A9856A87
  last_name: Jonas
  orcid: 0000-0001-5001-4804
- first_name: Hannah
  full_name: Monyer, Hannah
  last_name: Monyer
extern: '1'
intvolume: '       141'
language:
- iso: eng
main_file_link:
- url: http://www.springer.com/biomed/pharmaceutical+science/book/978-3-540-66120-7
month: '01'
oa_version: None
page: XXII, 535
place: Berlin ; Heidelberg
publication_identifier:
  eisbn:
  - 978-3-662-08022-1
  eissn:
  - 1865-0325
  isbn:
  - 978-3-642-08539-0
  issn:
  - 0171-2004
publication_status: published
publisher: Springer
publist_id: '3560'
quality_controlled: '1'
status: public
title: Ionotropic Glutamate Receptors in the CNS
type: book_editor
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 141
year: '1999'
...
---
_id: '3148'
abstract:
- lang: eng
  text: Accurate proteolytic processing of neuropeptide and peptide hormone precursors
    by members of the kexin/furin family of proteases is key to determining both the
    identities and activities of signaling peptides. Here we identify amontillado
    (amon), the Drosophila melanogaster homolog of the mammalian neuropeptide processing
    protease PC2, and show that in contrast to vertebrate PC2, amontillado expression
    undergoes extensive regulation in the nervous system during development. In situ
    hybridization reveals that expression of amontillado is restricted to the final
    stages of embryogenesis when it is found in anterior sensory structures and in
    only 168 cells in the brain and ventral nerve cord. After larvae hatch from their
    egg shells, the sensory structures and most cells in the CNS turn off or substantially
    reduce amontillado expression, suggesting that amontillado plays a specific role
    late in embryogenesis. Larvae lacking the chromosomal region containing amontillado
    show no gross anatomical defects and respond to touch. However, such larvae show
    a greatly reduced frequency of a hatching behavior of wild- type Drosophila in
    which larvae swing their heads, scraping through the eggshell with their mouth
    hooks. Ubiquitous expression of amontillado can restore near wild-type levels
    of this behavior, whereas expression of amontillado with an alanine substitution
    for the catalytic histidine cannot. These results suggest that amontillado expression
    is regulated as part of a programmed modulation of neural signaling that controls
    hatching behavior by producing specific neuropeptides in particular neurons at
    an appropriate developmental time.
acknowledgement: This research was supported by National Institutes of Health Grant
  GM39697 to R.S.F. D.S. was supported in part by National Institutes of Health training
  Grant 2T32GM07599. We thank M. A. Krasnow and members of his laboratory, particularly
  J. Jarecki, for technical guidance, encouragement, and stimulating scientific discussions.
  We thank A. Maghbouleh and the Stanford Statistics Department Consulting Service
  for help with statistical analysis. We thank G. Beitel, S. Dietrich, K. Guillemin,
  D. Micklem, Y. Nakajima, and members of the Fuller and Krasnow laboratories for
  comments on this manuscript. We thank M. Palazzolo for the use of theDrosophila
  head cDNA library, D. Kiehart for the use of a Drosophila myosin antibody, and D.
  Casso, F.-A. Ramirez-Weber, and T. B. Kornberg for use of the D/TM3SbKrGFP flies.
  We thank A. R. Kidd, D. Tolla, and M. Bender and D. Casso, F.-A. Ramirez-Weber and
  T. B. Kornberg for communication of results before publication
article_processing_charge: No
article_type: original
author:
- first_name: Daria E
  full_name: Siekhaus, Daria E
  id: 3D224B9E-F248-11E8-B48F-1D18A9856A87
  last_name: Siekhaus
  orcid: 0000-0001-8323-8353
- first_name: Robert
  full_name: Fuller, Robert
  last_name: Fuller
citation:
  ama: Siekhaus DE, Fuller R. A role for amontillado the Drosophila homolog of the
    neuropeptide precursor processing protease PC2 in triggering hatching behavior.
    <i>Journal of Neuroscience</i>. 1999;19(16):6942-6954. doi:<a href="https://doi.org/10.1523/jneurosci.19-16-06942.1999">10.1523/jneurosci.19-16-06942.1999</a>
  apa: Siekhaus, D. E., &#38; Fuller, R. (1999). A role for amontillado the Drosophila
    homolog of the neuropeptide precursor processing protease PC2 in triggering hatching
    behavior. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href="https://doi.org/10.1523/jneurosci.19-16-06942.1999">https://doi.org/10.1523/jneurosci.19-16-06942.1999</a>
  chicago: Siekhaus, Daria E, and Robert Fuller. “A Role for Amontillado the Drosophila
    Homolog of the Neuropeptide Precursor Processing Protease PC2 in Triggering Hatching
    Behavior.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 1999. <a
    href="https://doi.org/10.1523/jneurosci.19-16-06942.1999">https://doi.org/10.1523/jneurosci.19-16-06942.1999</a>.
  ieee: D. E. Siekhaus and R. Fuller, “A role for amontillado the Drosophila homolog
    of the neuropeptide precursor processing protease PC2 in triggering hatching behavior,”
    <i>Journal of Neuroscience</i>, vol. 19, no. 16. Society for Neuroscience, pp.
    6942–6954, 1999.
  ista: Siekhaus DE, Fuller R. 1999. A role for amontillado the Drosophila homolog
    of the neuropeptide precursor processing protease PC2 in triggering hatching behavior.
    Journal of Neuroscience. 19(16), 6942–6954.
  mla: Siekhaus, Daria E., and Robert Fuller. “A Role for Amontillado the Drosophila
    Homolog of the Neuropeptide Precursor Processing Protease PC2 in Triggering Hatching
    Behavior.” <i>Journal of Neuroscience</i>, vol. 19, no. 16, Society for Neuroscience,
    1999, pp. 6942–54, doi:<a href="https://doi.org/10.1523/jneurosci.19-16-06942.1999">10.1523/jneurosci.19-16-06942.1999</a>.
  short: D.E. Siekhaus, R. Fuller, Journal of Neuroscience 19 (1999) 6942–6954.
date_created: 2018-12-11T12:01:40Z
date_published: 1999-08-15T00:00:00Z
date_updated: 2022-09-07T13:48:41Z
day: '15'
doi: 10.1523/jneurosci.19-16-06942.1999
extern: '1'
external_id:
  pmid:
  - '10436051 '
intvolume: '        19'
issue: '16'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6782853/
month: '08'
oa: 1
oa_version: Published Version
page: 6942 - 6954
pmid: 1
publication: Journal of Neuroscience
publication_identifier:
  issn:
  - 0270-6474
publication_status: published
publisher: Society for Neuroscience
publist_id: '3547'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A role for amontillado the Drosophila homolog of the neuropeptide precursor
  processing protease PC2 in triggering hatching behavior
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 19
year: '1999'
...
---
OA_place: repository
OA_type: green
_id: '17815'
abstract:
- lang: eng
  text: The redshift at which the universe was reionized is currently unknown. We
    examine the optimal strategy for extracting this redshift, zreion, from the spectra
    of early sources. For a source located at a redshift zs beyond but close to the
    reionization redshift, (1 + zreion) < (1 + zs) < 32/27(1 + zreion), the Gunn-Peterson
    trough splits into disjoint Lyα, Lyβ, and possibly higher Lyman series troughs,
    with some transmitted flux between these troughs. We show that although the transmitted
    flux is suppressed considerably by the dense Lyα forest at high redshifts, it
    could still be detectable as long as zreion ≲ 8. If the ionizing sources are bright
    and have a short duty cycle (e.g., if they are miniquasars or starbursts with
    a lifetime ≲106 yr), then breakthrough occurs shortly after the H II regions around
    them overlap, and the transmitted flux provides a measurement of zreion. The Next
    Generation Space Telescope will reach the spectroscopic sensitivity required for
    such a measurement.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Zoltán
  full_name: Haiman, Zoltán
  id: 7c006e8c-cc0d-11ee-8322-cb904ef76f36
  last_name: Haiman
  orcid: 0000-0003-3633-5403
- first_name: Abraham
  full_name: Loeb, Abraham
  last_name: Loeb
citation:
  ama: Haiman Z, Loeb A. Determining the redshift of reionization from the spectra
    of high‐redshift sources. <i>The Astrophysical Journal</i>. 1999;519(2):479-485.
    doi:<a href="https://doi.org/10.1086/307393">10.1086/307393</a>
  apa: Haiman, Z., &#38; Loeb, A. (1999). Determining the redshift of reionization
    from the spectra of high‐redshift sources. <i>The Astrophysical Journal</i>. American
    Astronomical Society. <a href="https://doi.org/10.1086/307393">https://doi.org/10.1086/307393</a>
  chicago: Haiman, Zoltán, and Abraham Loeb. “Determining the Redshift of Reionization
    from the Spectra of High‐redshift Sources.” <i>The Astrophysical Journal</i>.
    American Astronomical Society, 1999. <a href="https://doi.org/10.1086/307393">https://doi.org/10.1086/307393</a>.
  ieee: Z. Haiman and A. Loeb, “Determining the redshift of reionization from the
    spectra of high‐redshift sources,” <i>The Astrophysical Journal</i>, vol. 519,
    no. 2. American Astronomical Society, pp. 479–485, 1999.
  ista: Haiman Z, Loeb A. 1999. Determining the redshift of reionization from the
    spectra of high‐redshift sources. The Astrophysical Journal. 519(2), 479–485.
  mla: Haiman, Zoltán, and Abraham Loeb. “Determining the Redshift of Reionization
    from the Spectra of High‐redshift Sources.” <i>The Astrophysical Journal</i>,
    vol. 519, no. 2, American Astronomical Society, 1999, pp. 479–85, doi:<a href="https://doi.org/10.1086/307393">10.1086/307393</a>.
  short: Z. Haiman, A. Loeb, The Astrophysical Journal 519 (1999) 479–485.
date_created: 2024-09-06T11:44:04Z
date_published: 1999-07-10T00:00:00Z
date_updated: 2024-11-12T12:19:49Z
day: '10'
doi: 10.1086/307393
extern: '1'
external_id:
  arxiv:
  - astro-ph/9807070
intvolume: '       519'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.astro-ph/9807070
month: '07'
oa: 1
oa_version: Preprint
page: 479-485
publication: The Astrophysical Journal
publication_identifier:
  eissn:
  - 1538-4357
  issn:
  - 0004-637X
publication_status: published
publisher: American Astronomical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Determining the redshift of reionization from the spectra of high‐redshift
  sources
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 519
year: '1999'
...
---
OA_place: repository
OA_type: green
_id: '17827'
abstract:
- lang: eng
  text: It is currently unknown whether the universe was reionized by quasars or stars
    at z ≳ 5. We point out that quasars can be best distinguished from stellar systems
    by their X-ray emission. Based on a simple hierarchical CDM model, we predict
    the number counts and X-ray fluxes of quasars at high redshifts. The model is
    consistent with available data on the luminosity function of high-redshift quasars
    in the optical and soft X-ray bands. The cumulative contribution of faint, undetected
    quasars in our model is consistent with the unresolved fraction of the X-ray background.
    We find that the Chandra X-ray Observatory might detect ~10^2 quasars from redshifts
    z ≳ 5 per its 17' × 17' field of view at the flux threshold of ~2 × 10^-16 ergs
    s^-1 cm^-2. The redshifts of these faint point sources could be identified by
    follow-up infrared observations from the ground or with the Next Generation Space
    Telescope.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Zoltán
  full_name: Haiman, Zoltán
  id: 7c006e8c-cc0d-11ee-8322-cb904ef76f36
  last_name: Haiman
  orcid: 0000-0003-3633-5403
- first_name: Abraham
  full_name: Loeb, Abraham
  last_name: Loeb
citation:
  ama: Haiman Z, Loeb A. X-ray emission from the first quasars. <i>The Astrophysical
    Journal</i>. 1999;521(1):L9-L12. doi:<a href="https://doi.org/10.1086/312177">10.1086/312177</a>
  apa: Haiman, Z., &#38; Loeb, A. (1999). X-ray emission from the first quasars. <i>The
    Astrophysical Journal</i>. American Astronomical Society. <a href="https://doi.org/10.1086/312177">https://doi.org/10.1086/312177</a>
  chicago: Haiman, Zoltán, and Abraham Loeb. “X-Ray Emission from the First Quasars.”
    <i>The Astrophysical Journal</i>. American Astronomical Society, 1999. <a href="https://doi.org/10.1086/312177">https://doi.org/10.1086/312177</a>.
  ieee: Z. Haiman and A. Loeb, “X-ray emission from the first quasars,” <i>The Astrophysical
    Journal</i>, vol. 521, no. 1. American Astronomical Society, pp. L9–L12, 1999.
  ista: Haiman Z, Loeb A. 1999. X-ray emission from the first quasars. The Astrophysical
    Journal. 521(1), L9–L12.
  mla: Haiman, Zoltán, and Abraham Loeb. “X-Ray Emission from the First Quasars.”
    <i>The Astrophysical Journal</i>, vol. 521, no. 1, American Astronomical Society,
    1999, pp. L9–12, doi:<a href="https://doi.org/10.1086/312177">10.1086/312177</a>.
  short: Z. Haiman, A. Loeb, The Astrophysical Journal 521 (1999) L9–L12.
date_created: 2024-09-06T12:06:45Z
date_published: 1999-08-10T00:00:00Z
date_updated: 2024-11-12T13:00:30Z
day: '10'
doi: 10.1086/312177
extern: '1'
external_id:
  arxiv:
  - astro-ph/9904340
intvolume: '       521'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.astro-ph/9904340
month: '08'
oa: 1
oa_version: Preprint
page: L9-L12
publication: The Astrophysical Journal
publication_identifier:
  issn:
  - 0004-637X
publication_status: published
publisher: American Astronomical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: X-ray emission from the first quasars
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 521
year: '1999'
...
---
OA_place: repository
OA_type: green
_id: '17835'
abstract:
- lang: eng
  text: Models are presented for the Lyα emission of dusty high-redshift galaxies
    by combining the Press-Schechter formalism with a treatment of the inhomogeneous
    dust distribution inside galaxies. It is found that the amount of Lyα radiation
    escaping from the galaxies strongly depends on the time over which the dust is
    produced through stellar activity and on the ambient inhomogeneity of the H II
    regions that surround the ionizing OB stars. Good agreement is found with recent
    observations, as well as with previous nondetections. Although a detailed determination
    of the individual model parameters is precluded by uncertainties, we find that
    (1) the dust content in primordial galaxies builds up in no more than ~5 × 108
    yr, (2) the galactic H II regions are inhomogeneous with a cloud-covering factor
    of order unity, and (3) the overall star formation efficiency is at least ~5%.
    It is predicted that future observations can detect these Lyα galaxies up to redshifts
    of ~8. If the universe is reionized at zr ≲ 8, the corresponding decline in the
    number of Lyα emitters at z ≳ zr could prove to be a useful probe of the reionization
    epoch.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Zoltán
  full_name: Haiman, Zoltán
  id: 7c006e8c-cc0d-11ee-8322-cb904ef76f36
  last_name: Haiman
  orcid: 0000-0003-3633-5403
- first_name: Marco
  full_name: Spaans, Marco
  last_name: Spaans
citation:
  ama: Haiman Z, Spaans M. Models for dusty Lyα emitters at high redshift. <i>The
    Astrophysical Journal</i>. 1999;518(1):138-144. doi:<a href="https://doi.org/10.1086/307276">10.1086/307276</a>
  apa: Haiman, Z., &#38; Spaans, M. (1999). Models for dusty Lyα emitters at high
    redshift. <i>The Astrophysical Journal</i>. American Astronomical Society. <a
    href="https://doi.org/10.1086/307276">https://doi.org/10.1086/307276</a>
  chicago: Haiman, Zoltán, and Marco Spaans. “Models for Dusty Lyα Emitters at High
    Redshift.” <i>The Astrophysical Journal</i>. American Astronomical Society, 1999.
    <a href="https://doi.org/10.1086/307276">https://doi.org/10.1086/307276</a>.
  ieee: Z. Haiman and M. Spaans, “Models for dusty Lyα emitters at high redshift,”
    <i>The Astrophysical Journal</i>, vol. 518, no. 1. American Astronomical Society,
    pp. 138–144, 1999.
  ista: Haiman Z, Spaans M. 1999. Models for dusty Lyα emitters at high redshift.
    The Astrophysical Journal. 518(1), 138–144.
  mla: Haiman, Zoltán, and Marco Spaans. “Models for Dusty Lyα Emitters at High Redshift.”
    <i>The Astrophysical Journal</i>, vol. 518, no. 1, American Astronomical Society,
    1999, pp. 138–44, doi:<a href="https://doi.org/10.1086/307276">10.1086/307276</a>.
  short: Z. Haiman, M. Spaans, The Astrophysical Journal 518 (1999) 138–144.
date_created: 2024-09-06T12:13:30Z
date_published: 1999-06-10T00:00:00Z
date_updated: 2024-11-13T07:30:03Z
day: '10'
doi: 10.1086/307276
extern: '1'
external_id:
  arxiv:
  - astro-ph/9809223
intvolume: '       518'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.astro-ph/9809223
month: '06'
oa: 1
oa_version: Preprint
page: 138-144
publication: The Astrophysical Journal
publication_identifier:
  eissn:
  - 1538-4357
  issn:
  - 0004-637X
publication_status: published
publisher: American Astronomical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Models for dusty Lyα emitters at high redshift
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 518
year: '1999'
...
---
OA_place: repository
OA_type: green
_id: '17836'
abstract:
- lang: eng
  text: "We examine various observable signatures of the first generation of stars
    and low-luminosity quasars, including the metal enrichment, radiation background,
    and dust opacity/emission that they produce. We calculate the formation history
    of collapsed baryonic halos, based on an extension of the Press-Schechter formalism,
    incorporating the effects of pressure and H2-dissociation. We then use the observed
    C/H ratio at z=3 in the Lyman-α forest clouds to obtain an average the star formation
    efficiency in these halos. Similarly, we fit the efficiency of black-hole formation,
    and the shape of quasar light curves, to match the observed quasar luminosity
    function (LF) between z=2−4, and use this fit to extrapolate the quasar LF to
    faint magnitudes and high redshifts. To be consistent with the lack of faint point-sources
    in the Hubble Deep Field, we impose a lower limit of ∼ 75 km s−1 for the circular
    velocities of halos harboring central black holes.\r\nWe find that in a ΛCDM model,
    stars reionize the IGM at zreion=9−13, and quasars at z=12. Observationally, zreion
    can be measured by the forthcoming MAP and Planck Surveyor satellites, via the
    damping of CMB anisotropies by ∼10% on small angular scales due to electron scattering.
    We show that if reionization occurs later, at 5 ≲ zreion ≲ 10, then it can be
    measured from the spectra of individual sources. We also find that the Next Generation
    Space Telescope will be able to directly image about 1–40 star clusters, and a
    few faint quasars, from z >10 per square arcminute. The amount of dust produced
    by the first supernovae has an optical depth of τ=0.1−1 towards high redshift
    sources, and the reprocessed UV flux of stars and quasars distorts the cosmic
    microwave background radiation (CMB) by a Compton y-parameter comparable to the
    COBE limit, y ∼ 1.5 × 10^−5."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Zoltán
  full_name: Haiman, Zoltán
  id: 7c006e8c-cc0d-11ee-8322-cb904ef76f36
  last_name: Haiman
  orcid: 0000-0003-3633-5403
citation:
  ama: Haiman Z. Formation of the first stars and quasars. <i>Advances in Space Research</i>.
    1999;23(5-6):915-924. doi:<a href="https://doi.org/10.1016/s0273-1177(99)00216-1">10.1016/s0273-1177(99)00216-1</a>
  apa: Haiman, Z. (1999). Formation of the first stars and quasars. <i>Advances in
    Space Research</i>. Elsevier. <a href="https://doi.org/10.1016/s0273-1177(99)00216-1">https://doi.org/10.1016/s0273-1177(99)00216-1</a>
  chicago: Haiman, Zoltán. “Formation of the First Stars and Quasars.” <i>Advances
    in Space Research</i>. Elsevier, 1999. <a href="https://doi.org/10.1016/s0273-1177(99)00216-1">https://doi.org/10.1016/s0273-1177(99)00216-1</a>.
  ieee: Z. Haiman, “Formation of the first stars and quasars,” <i>Advances in Space
    Research</i>, vol. 23, no. 5–6. Elsevier, pp. 915–924, 1999.
  ista: Haiman Z. 1999. Formation of the first stars and quasars. Advances in Space
    Research. 23(5–6), 915–924.
  mla: Haiman, Zoltán. “Formation of the First Stars and Quasars.” <i>Advances in
    Space Research</i>, vol. 23, no. 5–6, Elsevier, 1999, pp. 915–24, doi:<a href="https://doi.org/10.1016/s0273-1177(99)00216-1">10.1016/s0273-1177(99)00216-1</a>.
  short: Z. Haiman, Advances in Space Research 23 (1999) 915–924.
date_created: 2024-09-06T12:14:07Z
date_published: 1999-07-12T00:00:00Z
date_updated: 2024-11-13T07:35:24Z
day: '12'
doi: 10.1016/s0273-1177(99)00216-1
extern: '1'
external_id:
  arxiv:
  - astro-ph/9809365
intvolume: '        23'
issue: 5-6
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.astro-ph/9809365
month: '07'
oa: 1
oa_version: Preprint
page: 915-924
publication: Advances in Space Research
publication_identifier:
  issn:
  - 0273-1177
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Formation of the first stars and quasars
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '1999'
...
---
OA_place: repository
OA_type: green
_id: '17837'
abstract:
- lang: eng
  text: High-resolution, deep-imaging surveys are instrumental in setting constraints
    on semianalytical structure formation models in cold dark matter (CDM) cosmologies.
    We show here that the lack of unresolved B-band "dropouts" with V>25 mag in the
    Hubble Deep Field appears to be inconsistent with the number of "miniquasars"
    expected if massive black holes form with a constant universal efficiency in all
    CDM halos. To reconcile the models with the data, a mechanism is needed that suppresses
    the formation of active nuclei in halos with circular velocities vcirc≲50-75 km
    s-1. This feedback naturally arises because of the photoionization heating of
    the gas by the UV background. We consider several alternative effects that would
    help reducing the number of miniquasars and find that these cannot alone account
    for the observed lack of detections. If reddening by dust can be neglected at
    early epochs, consistency with the optical data also requires that the luminous
    extent of dwarf galaxies at high redshifts be larger than a few percent of the
    virial radii of their dark matter halos, in order not to overpredict the number
    of pointlike B-band dropouts. Future deep observations in the J and H bands with
    NICMOS might reveal several z≳5 objects per field or provide even stronger constraints
    on the models than existing B, V, and I data.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Zoltán
  full_name: Haiman, Zoltán
  id: 7c006e8c-cc0d-11ee-8322-cb904ef76f36
  last_name: Haiman
  orcid: 0000-0003-3633-5403
- first_name: Piero
  full_name: Madau, Piero
  last_name: Madau
- first_name: Abraham
  full_name: Loeb, Abraham
  last_name: Loeb
citation:
  ama: Haiman Z, Madau P, Loeb A. Constraints from the Hubble deep field on high‐redshift
    quasar models. <i>The Astrophysical Journal</i>. 1999;514(2):535-543. doi:<a href="https://doi.org/10.1086/306969">10.1086/306969</a>
  apa: Haiman, Z., Madau, P., &#38; Loeb, A. (1999). Constraints from the Hubble deep
    field on high‐redshift quasar models. <i>The Astrophysical Journal</i>. American
    Astronomical Society. <a href="https://doi.org/10.1086/306969">https://doi.org/10.1086/306969</a>
  chicago: Haiman, Zoltán, Piero Madau, and Abraham Loeb. “Constraints from the Hubble
    Deep Field on High‐redshift Quasar Models.” <i>The Astrophysical Journal</i>.
    American Astronomical Society, 1999. <a href="https://doi.org/10.1086/306969">https://doi.org/10.1086/306969</a>.
  ieee: Z. Haiman, P. Madau, and A. Loeb, “Constraints from the Hubble deep field
    on high‐redshift quasar models,” <i>The Astrophysical Journal</i>, vol. 514, no.
    2. American Astronomical Society, pp. 535–543, 1999.
  ista: Haiman Z, Madau P, Loeb A. 1999. Constraints from the Hubble deep field on
    high‐redshift quasar models. The Astrophysical Journal. 514(2), 535–543.
  mla: Haiman, Zoltán, et al. “Constraints from the Hubble Deep Field on High‐redshift
    Quasar Models.” <i>The Astrophysical Journal</i>, vol. 514, no. 2, American Astronomical
    Society, 1999, pp. 535–43, doi:<a href="https://doi.org/10.1086/306969">10.1086/306969</a>.
  short: Z. Haiman, P. Madau, A. Loeb, The Astrophysical Journal 514 (1999) 535–543.
date_created: 2024-09-06T12:14:48Z
date_published: 1999-04-01T00:00:00Z
date_updated: 2024-11-13T07:37:51Z
day: '01'
doi: 10.1086/306969
extern: '1'
external_id:
  arxiv:
  - astro-ph/9805258
intvolume: '       514'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.astro-ph/9805258
month: '04'
oa: 1
oa_version: Preprint
page: 535-543
publication: The Astrophysical Journal
publication_identifier:
  eissn:
  - 1538-4357
  issn:
  - 0004-637X
publication_status: published
publisher: American Astronomical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Constraints from the Hubble deep field on high‐redshift quasar models
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 514
year: '1999'
...
---
OA_type: closed access
_id: '18047'
abstract:
- lang: eng
  text: Scanning tunneling microscopy (STM) has been used to characterize the structure
    and electronic properties of molybdenum selenide (Mo6⁢Se6) molecular wires. STM
    images resolve the 0.45 nm unit cell repeat in isolated molecular wires and bundles
    of wires. Tunneling spectroscopy measurements exhibit sharp peaks in the local
    density of states that are consistent with the Van Hove singularities expected
    for a one-dimensional (1D) system. These data have been compared with previous
    band structure calculations. Preliminary measurements at 5 K show no evidence
    of a gap opening at low temperatures. The implications of these results to metal-insulator
    transitions in 1D systems are discussed.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Latha
  full_name: Venkataraman, Latha
  id: 9ebb78a5-cc0d-11ee-8322-fae086a32caf
  last_name: Venkataraman
  orcid: 0000-0002-6957-6089
- first_name: Charles M.
  full_name: Lieber, Charles M.
  last_name: Lieber
citation:
  ama: Venkataraman L, Lieber CM. Molybdenum selenide molecular wires as one-dimensional
    conductors. <i>Physical Review Letters</i>. 1999;83(25):5334-5337. doi:<a href="https://doi.org/10.1103/physrevlett.83.5334">10.1103/physrevlett.83.5334</a>
  apa: Venkataraman, L., &#38; Lieber, C. M. (1999). Molybdenum selenide molecular
    wires as one-dimensional conductors. <i>Physical Review Letters</i>. American
    Physical Society. <a href="https://doi.org/10.1103/physrevlett.83.5334">https://doi.org/10.1103/physrevlett.83.5334</a>
  chicago: Venkataraman, Latha, and Charles M. Lieber. “Molybdenum Selenide Molecular
    Wires as One-Dimensional Conductors.” <i>Physical Review Letters</i>. American
    Physical Society, 1999. <a href="https://doi.org/10.1103/physrevlett.83.5334">https://doi.org/10.1103/physrevlett.83.5334</a>.
  ieee: L. Venkataraman and C. M. Lieber, “Molybdenum selenide molecular wires as
    one-dimensional conductors,” <i>Physical Review Letters</i>, vol. 83, no. 25.
    American Physical Society, pp. 5334–5337, 1999.
  ista: Venkataraman L, Lieber CM. 1999. Molybdenum selenide molecular wires as one-dimensional
    conductors. Physical Review Letters. 83(25), 5334–5337.
  mla: Venkataraman, Latha, and Charles M. Lieber. “Molybdenum Selenide Molecular
    Wires as One-Dimensional Conductors.” <i>Physical Review Letters</i>, vol. 83,
    no. 25, American Physical Society, 1999, pp. 5334–37, doi:<a href="https://doi.org/10.1103/physrevlett.83.5334">10.1103/physrevlett.83.5334</a>.
  short: L. Venkataraman, C.M. Lieber, Physical Review Letters 83 (1999) 5334–5337.
date_created: 2024-09-10T06:08:14Z
date_published: 1999-12-20T00:00:00Z
date_updated: 2025-01-03T11:24:21Z
day: '20'
doi: 10.1103/physrevlett.83.5334
extern: '1'
intvolume: '        83'
issue: '25'
language:
- iso: eng
month: '12'
oa_version: None
page: 5334-5337
publication: Physical Review Letters
publication_identifier:
  eissn:
  - 1079-7114
  issn:
  - 0031-9007
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Molybdenum selenide molecular wires as one-dimensional conductors
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 83
year: '1999'
...
