---
_id: '5582'
abstract:
- lang: eng
  text: Data on Austrian open access publication output at Taylor&Francis from 2013-2017
    including data analysis.
article_processing_charge: No
author:
- first_name: Márton
  full_name: Villányi, Márton
  id: 3FFCCD3A-F248-11E8-B48F-1D18A9856A87
  last_name: Villányi
  orcid: 0000-0001-8126-0426
citation:
  ama: Villányi M. Taylor&#38;Francis Austrian Publications 2013-2017. 2018. doi:<a
    href="https://doi.org/10.15479/AT:ISTA:94">10.15479/AT:ISTA:94</a>
  apa: Villányi, M. (2018). Taylor&#38;Francis Austrian Publications 2013-2017. Institute
    of Science and Technology Austria. <a href="https://doi.org/10.15479/AT:ISTA:94">https://doi.org/10.15479/AT:ISTA:94</a>
  chicago: Villányi, Márton. “Taylor&#38;Francis Austrian Publications 2013-2017.”
    Institute of Science and Technology Austria, 2018. <a href="https://doi.org/10.15479/AT:ISTA:94">https://doi.org/10.15479/AT:ISTA:94</a>.
  ieee: M. Villányi, “Taylor&#38;Francis Austrian Publications 2013-2017.” Institute
    of Science and Technology Austria, 2018.
  ista: Villányi M. 2018. Taylor&#38;Francis Austrian Publications 2013-2017, Institute
    of Science and Technology Austria, <a href="https://doi.org/10.15479/AT:ISTA:94">10.15479/AT:ISTA:94</a>.
  mla: Villányi, Márton. <i>Taylor&#38;Francis Austrian Publications 2013-2017</i>.
    Institute of Science and Technology Austria, 2018, doi:<a href="https://doi.org/10.15479/AT:ISTA:94">10.15479/AT:ISTA:94</a>.
  short: M. Villányi, (2018).
datarep_id: '94'
date_created: 2018-12-12T12:31:39Z
date_published: 2018-01-16T00:00:00Z
date_updated: 2024-02-21T13:43:41Z
day: '16'
ddc:
- '020'
department:
- _id: E-Lib
doi: 10.15479/AT:ISTA:94
file:
- access_level: open_access
  checksum: 3e000daf15d7eb9a47b234f3d20dd4b8
  content_type: application/zip
  creator: system
  date_created: 2018-12-12T13:02:59Z
  date_updated: 2020-07-14T12:47:07Z
  file_id: '5617'
  file_name: IST-2018-94-v1+1_Taylor_Francis_Austrian_Publications_2013-2017.zip
  file_size: 2552326
  relation: main_file
file_date_updated: 2020-07-14T12:47:07Z
has_accepted_license: '1'
keyword:
- Publication analysis
- Bibliography
- Open Access
license: https://creativecommons.org/publicdomain/zero/1.0/
month: '01'
oa: 1
oa_version: Submitted Version
publisher: Institute of Science and Technology Austria
related_material:
  record:
  - id: '278'
    relation: part_of_dissertation
    status: public
status: public
title: Taylor&Francis Austrian Publications 2013-2017
tmp:
  image: /images/cc_0.png
  legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
  name: Creative Commons Public Domain Dedication (CC0 1.0)
  short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '6459'
author:
- first_name: Barbara
  full_name: Petritsch, Barbara
  id: 406048EC-F248-11E8-B48F-1D18A9856A87
  last_name: Petritsch
  orcid: 0000-0003-2724-4614
citation:
  ama: Petritsch B. <i>Open Access at IST Austria 2009-2017</i>. IST Austria; 2018.
    doi:<a href="https://doi.org/10.5281/zenodo.1410279">10.5281/zenodo.1410279</a>
  apa: 'Petritsch, B. (2018). <i>Open Access at IST Austria 2009-2017</i>. Presented
    at the Open-Access-Tage, Graz, Austria: IST Austria. <a href="https://doi.org/10.5281/zenodo.1410279">https://doi.org/10.5281/zenodo.1410279</a>'
  chicago: Petritsch, Barbara. <i>Open Access at IST Austria 2009-2017</i>. IST Austria,
    2018. <a href="https://doi.org/10.5281/zenodo.1410279">https://doi.org/10.5281/zenodo.1410279</a>.
  ieee: B. Petritsch, <i>Open Access at IST Austria 2009-2017</i>. IST Austria, 2018.
  ista: Petritsch B. 2018. Open Access at IST Austria 2009-2017, IST Austria,p.
  mla: Petritsch, Barbara. <i>Open Access at IST Austria 2009-2017</i>. IST Austria,
    2018, doi:<a href="https://doi.org/10.5281/zenodo.1410279">10.5281/zenodo.1410279</a>.
  short: B. Petritsch, Open Access at IST Austria 2009-2017, IST Austria, 2018.
conference:
  end_date: 2018-09-26
  location: Graz, Austria
  name: Open-Access-Tage
  start_date: 2018-09-24
date_created: 2019-05-16T07:27:14Z
date_published: 2018-09-24T00:00:00Z
date_updated: 2020-07-14T23:06:21Z
day: '24'
ddc:
- '020'
department:
- _id: E-Lib
doi: 10.5281/zenodo.1410279
file:
- access_level: open_access
  checksum: 9063ab4d10ea93353c3a03bbf53fbcf1
  content_type: application/pdf
  creator: dernst
  date_created: 2019-05-16T07:26:25Z
  date_updated: 2020-07-14T12:47:30Z
  file_id: '6460'
  file_name: Poster_Beitrag_125_Petritsch.pdf
  file_size: 1967778
  relation: main_file
file_date_updated: 2020-07-14T12:47:30Z
has_accepted_license: '1'
keyword:
- Open Access
- Publication Analysis
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '09'
oa: 1
oa_version: Published Version
publication_status: published
publisher: IST Austria
status: public
title: Open Access at IST Austria 2009-2017
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: conference_poster
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '11633'
abstract:
- lang: eng
  text: Our understanding of stars through asteroseismic data analysis is limited
    by our ability to take advantage of the huge amount of observed stars provided
    by space missions such as CoRoT, Kepler , K2, and soon TESS and PLATO. Global
    seismic pipelines provide global stellar parameters such as mass and radius using
    the mean seismic parameters, as well as the effective temperature. These pipelines
    are commonly used automatically on thousands of stars observed by K2 for 3 months
    (and soon TESS for at least ∼ 1 month). However, pipelines are not immune from
    misidentifying noise peaks and stellar oscillations. Therefore, new validation
    techniques are required to assess the quality of these results. We present a new
    metric called FliPer (Flicker in Power), which takes into account the average
    variability at all measured time scales. The proper calibration of FliPer enables
    us to obtain good estimations of global stellar parameters such as surface gravity
    that are robust against the influence of noise peaks and hence are an excellent
    way to find faults in asteroseismic pipelines.
article_number: '1711.02890'
article_processing_charge: No
arxiv: 1
author:
- first_name: Lisa Annabelle
  full_name: Bugnet, Lisa Annabelle
  id: d9edb345-f866-11ec-9b37-d119b5234501
  last_name: Bugnet
  orcid: 0000-0003-0142-4000
- first_name: R. A.
  full_name: Garcia, R. A.
  last_name: Garcia
- first_name: G. R.
  full_name: Davies, G. R.
  last_name: Davies
- first_name: S.
  full_name: Mathur, S.
  last_name: Mathur
- first_name: E.
  full_name: Corsaro, E.
  last_name: Corsaro
citation:
  ama: 'Bugnet LA, Garcia RA, Davies GR, Mathur S, Corsaro E. FliPer: Checking the
    reliability of global seismic parameters from automatic pipelines. <i>arXiv</i>.
    doi:<a href="https://doi.org/10.48550/arXiv.1711.02890">10.48550/arXiv.1711.02890</a>'
  apa: 'Bugnet, L. A., Garcia, R. A., Davies, G. R., Mathur, S., &#38; Corsaro, E.
    (n.d.). FliPer: Checking the reliability of global seismic parameters from automatic
    pipelines. <i>arXiv</i>. <a href="https://doi.org/10.48550/arXiv.1711.02890">https://doi.org/10.48550/arXiv.1711.02890</a>'
  chicago: 'Bugnet, Lisa Annabelle, R. A. Garcia, G. R. Davies, S. Mathur, and E.
    Corsaro. “FliPer: Checking the Reliability of Global Seismic Parameters from Automatic
    Pipelines.” <i>ArXiv</i>, n.d. <a href="https://doi.org/10.48550/arXiv.1711.02890">https://doi.org/10.48550/arXiv.1711.02890</a>.'
  ieee: 'L. A. Bugnet, R. A. Garcia, G. R. Davies, S. Mathur, and E. Corsaro, “FliPer:
    Checking the reliability of global seismic parameters from automatic pipelines,”
    <i>arXiv</i>. .'
  ista: 'Bugnet LA, Garcia RA, Davies GR, Mathur S, Corsaro E. FliPer: Checking the
    reliability of global seismic parameters from automatic pipelines. arXiv, 1711.02890.'
  mla: 'Bugnet, Lisa Annabelle, et al. “FliPer: Checking the Reliability of Global
    Seismic Parameters from Automatic Pipelines.” <i>ArXiv</i>, 1711.02890, doi:<a
    href="https://doi.org/10.48550/arXiv.1711.02890">10.48550/arXiv.1711.02890</a>.'
  short: L.A. Bugnet, R.A. Garcia, G.R. Davies, S. Mathur, E. Corsaro, ArXiv (n.d.).
date_created: 2022-07-21T07:13:13Z
date_published: 2017-11-08T00:00:00Z
date_updated: 2022-08-22T08:45:42Z
day: '08'
doi: 10.48550/arXiv.1711.02890
extern: '1'
external_id:
  arxiv:
  - '1711.02890'
keyword:
- asteroseismology - methods
- data analysis - stars
- oscillations
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.1711.02890
month: '11'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
status: public
title: 'FliPer: Checking the reliability of global seismic parameters from automatic
  pipelines'
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '10396'
abstract:
- lang: eng
  text: Stimfit is a free cross-platform software package for viewing and analyzing
    electrophysiological data. It supports most standard file types for cellular neurophysiology
    and other biomedical formats. Its analysis algorithms have been used and validated
    in several experimental laboratories. Its embedded Python scripting interface
    makes Stimfit highly extensible and customizable.
article_number: '000010151520134181'
article_processing_charge: No
article_type: original
author:
- first_name: Alois
  full_name: Schlögl, Alois
  id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
  last_name: Schlögl
  orcid: 0000-0002-5621-8100
- 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: C.
  full_name: Schmidt-Hieber, C.
  last_name: Schmidt-Hieber
- first_name: S. J.
  full_name: Guzman, S. J.
  last_name: Guzman
citation:
  ama: 'Schlögl A, Jonas PM, Schmidt-Hieber C, Guzman SJ. Stimfit: A fast visualization
    and analysis environment for cellular neurophysiology. <i>Biomedical Engineering
    / Biomedizinische Technik</i>. 2013;58(SI-1-Track-G). doi:<a href="https://doi.org/10.1515/bmt-2013-4181">10.1515/bmt-2013-4181</a>'
  apa: 'Schlögl, A., Jonas, P. M., Schmidt-Hieber, C., &#38; Guzman, S. J. (2013).
    Stimfit: A fast visualization and analysis environment for cellular neurophysiology.
    <i>Biomedical Engineering / Biomedizinische Technik</i>. Graz, Austria: De Gruyter.
    <a href="https://doi.org/10.1515/bmt-2013-4181">https://doi.org/10.1515/bmt-2013-4181</a>'
  chicago: 'Schlögl, Alois, Peter M Jonas, C. Schmidt-Hieber, and S. J. Guzman. “Stimfit:
    A Fast Visualization and Analysis Environment for Cellular Neurophysiology.” <i>Biomedical
    Engineering / Biomedizinische Technik</i>. De Gruyter, 2013. <a href="https://doi.org/10.1515/bmt-2013-4181">https://doi.org/10.1515/bmt-2013-4181</a>.'
  ieee: 'A. Schlögl, P. M. Jonas, C. Schmidt-Hieber, and S. J. Guzman, “Stimfit: A
    fast visualization and analysis environment for cellular neurophysiology,” <i>Biomedical
    Engineering / Biomedizinische Technik</i>, vol. 58, no. SI-1-Track-G. De Gruyter,
    2013.'
  ista: 'Schlögl A, Jonas PM, Schmidt-Hieber C, Guzman SJ. 2013. Stimfit: A fast visualization
    and analysis environment for cellular neurophysiology. Biomedical Engineering
    / Biomedizinische Technik. 58(SI-1-Track-G), 000010151520134181.'
  mla: 'Schlögl, Alois, et al. “Stimfit: A Fast Visualization and Analysis Environment
    for Cellular Neurophysiology.” <i>Biomedical Engineering / Biomedizinische Technik</i>,
    vol. 58, no. SI-1-Track-G, 000010151520134181, De Gruyter, 2013, doi:<a href="https://doi.org/10.1515/bmt-2013-4181">10.1515/bmt-2013-4181</a>.'
  short: A. Schlögl, P.M. Jonas, C. Schmidt-Hieber, S.J. Guzman, Biomedical Engineering
    / Biomedizinische Technik 58 (2013).
conference:
  end_date: 2013-09-21
  location: Graz, Austria
  name: 'BMT: Biomedizinische Technik '
  start_date: 2013-09-19
date_created: 2021-12-01T14:35:35Z
date_published: 2013-08-01T00:00:00Z
date_updated: 2021-12-02T12:51:12Z
day: '01'
ddc:
- '005'
- '610'
department:
- _id: PeJo
doi: 10.1515/bmt-2013-4181
external_id:
  pmid:
  - '24042795'
file:
- access_level: open_access
  checksum: cdfc5339b530a25d6079f7223f0b1f16
  content_type: application/pdf
  creator: schloegl
  date_created: 2021-12-01T14:38:08Z
  date_updated: 2021-12-01T14:38:08Z
  file_id: '10397'
  file_name: Schloegl_Abstract-BMT2013.pdf
  file_size: 149825
  relation: main_file
  success: 1
file_date_updated: 2021-12-01T14:38:08Z
has_accepted_license: '1'
intvolume: '        58'
issue: SI-1-Track-G
keyword:
- biomedical engineering
- data analysis
- free software
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
pmid: 1
publication: Biomedical Engineering / Biomedizinische Technik
publication_identifier:
  eissn:
  - 1862-278X
  issn:
  - 0013-5585
publication_status: published
publisher: De Gruyter
quality_controlled: '1'
status: public
title: 'Stimfit: A fast visualization and analysis environment for cellular neurophysiology'
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 58
year: '2013'
...
---
_id: '9943'
abstract:
- lang: eng
  text: Segmentation is the process of partitioning digital images into meaningful
    regions. The analysis of biological high content images often requires segmentation
    as a first step. We propose ilastik as an easy-to-use tool which allows the user
    without expertise in image processing to perform segmentation and classification
    in a unified way. ilastik learns from labels provided by the user through a convenient
    mouse interface. Based on these labels, ilastik infers a problem specific segmentation.
    A random forest classifier is used in the learning step, in which each pixel's
    neighborhood is characterized by a set of generic (nonlinear) features. ilastik
    supports up to three spatial plus one spectral dimension and makes use of all
    dimensions in the feature calculation. ilastik provides realtime feedback that
    enables the user to interactively refine the segmentation result and hence further
    fine-tune the classifier. An uncertainty measure guides the user to ambiguous
    regions in the images. Real time performance is achieved by multi-threading which
    fully exploits the capabilities of modern multi-core machines. Once a classifier
    has been trained on a set of representative images, it can be exported and used
    to automatically process a very large number of images (e.g. using the CellProfiler
    pipeline). ilastik is an open source project and released under the BSD license
    at www.ilastik.org.
article_processing_charge: No
author:
- first_name: Christoph M
  full_name: Sommer, Christoph M
  id: 4DF26D8C-F248-11E8-B48F-1D18A9856A87
  last_name: Sommer
  orcid: 0000-0003-1216-9105
- first_name: Christoph
  full_name: Straehle, Christoph
  last_name: Straehle
- first_name: Ullrich
  full_name: Köthe, Ullrich
  last_name: Köthe
- first_name: Fred A.
  full_name: Hamprecht, Fred A.
  last_name: Hamprecht
citation:
  ama: 'Sommer CM, Straehle C, Köthe U, Hamprecht FA. Ilastik: Interactive learning
    and segmentation toolkit. In: <i>2011 IEEE International Symposium on Biomedical
    Imaging: From Nano to Micro</i>. Institute of Electrical and Electronics Engineers;
    2011. doi:<a href="https://doi.org/10.1109/isbi.2011.5872394">10.1109/isbi.2011.5872394</a>'
  apa: 'Sommer, C. M., Straehle, C., Köthe, U., &#38; Hamprecht, F. A. (2011). Ilastik:
    Interactive learning and segmentation toolkit. In <i>2011 IEEE International Symposium
    on Biomedical Imaging: from Nano to Micro</i>. Chicago, Illinois, USA: Institute
    of Electrical and Electronics Engineers. <a href="https://doi.org/10.1109/isbi.2011.5872394">https://doi.org/10.1109/isbi.2011.5872394</a>'
  chicago: 'Sommer, Christoph M, Christoph Straehle, Ullrich Köthe, and Fred A. Hamprecht.
    “Ilastik: Interactive Learning and Segmentation Toolkit.” In <i>2011 IEEE International
    Symposium on Biomedical Imaging: From Nano to Micro</i>. Institute of Electrical
    and Electronics Engineers, 2011. <a href="https://doi.org/10.1109/isbi.2011.5872394">https://doi.org/10.1109/isbi.2011.5872394</a>.'
  ieee: 'C. M. Sommer, C. Straehle, U. Köthe, and F. A. Hamprecht, “Ilastik: Interactive
    learning and segmentation toolkit,” in <i>2011 IEEE International Symposium on
    Biomedical Imaging: from Nano to Micro</i>, Chicago, Illinois, USA, 2011.'
  ista: 'Sommer CM, Straehle C, Köthe U, Hamprecht FA. 2011. Ilastik: Interactive
    learning and segmentation toolkit. 2011 IEEE International Symposium on Biomedical
    Imaging: from Nano to Micro. ISBI: International Symposium on Biomedical Imaging.'
  mla: 'Sommer, Christoph M., et al. “Ilastik: Interactive Learning and Segmentation
    Toolkit.” <i>2011 IEEE International Symposium on Biomedical Imaging: From Nano
    to Micro</i>, Institute of Electrical and Electronics Engineers, 2011, doi:<a
    href="https://doi.org/10.1109/isbi.2011.5872394">10.1109/isbi.2011.5872394</a>.'
  short: 'C.M. Sommer, C. Straehle, U. Köthe, F.A. Hamprecht, in:, 2011 IEEE International
    Symposium on Biomedical Imaging: From Nano to Micro, Institute of Electrical and
    Electronics Engineers, 2011.'
conference:
  end_date: 2011-04-02
  location: Chicago, Illinois, USA
  name: 'ISBI: International Symposium on Biomedical Imaging'
  start_date: 2011-03-30
date_created: 2021-08-19T11:49:58Z
date_published: 2011-06-09T00:00:00Z
date_updated: 2023-02-23T14:13:38Z
day: '09'
department:
- _id: Bio
doi: 10.1109/isbi.2011.5872394
extern: '1'
keyword:
- image segmentation
- biomedical imaging
- three dimensional displays
- neurons
- retina
- observers
- image color analysis
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://www.researchgate.net/publication/224241106_Ilastik_Interactive_learning_and_segmentation_toolkit
month: '06'
oa: 1
oa_version: Preprint
publication: '2011 IEEE International Symposium on Biomedical Imaging: from Nano to
  Micro'
publication_identifier:
  eissn:
  - 1945-8452
  isbn:
  - 978-1-4244-4127-3
  issn:
  - 1945-7928
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
status: public
title: 'Ilastik: Interactive learning and segmentation toolkit'
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2011'
...
---
_id: '11698'
abstract:
- lang: eng
  text: We give a short survey of the use of hyperlink analysis in web search engine
    ranking and sketch other applications of hyperlink analysis in the web space.
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
citation:
  ama: 'Henzinger MH. Hyperlink analysis on the world wide web. In: <i>Proceedings
    of the 16th ACM Conference on Hypertext and Hypermedia</i>. Association for Computing
    Machinery; 2005:1-3. doi:<a href="https://doi.org/10.1145/1083356.1083357">10.1145/1083356.1083357</a>'
  apa: 'Henzinger, M. H. (2005). Hyperlink analysis on the world wide web. In <i>Proceedings
    of the 16th ACM conference on Hypertext and hypermedia</i> (pp. 1–3). Salzburg,
    Austria: Association for Computing Machinery. <a href="https://doi.org/10.1145/1083356.1083357">https://doi.org/10.1145/1083356.1083357</a>'
  chicago: Henzinger, Monika H. “Hyperlink Analysis on the World Wide Web.” In <i>Proceedings
    of the 16th ACM Conference on Hypertext and Hypermedia</i>, 1–3. Association for
    Computing Machinery, 2005. <a href="https://doi.org/10.1145/1083356.1083357">https://doi.org/10.1145/1083356.1083357</a>.
  ieee: M. H. Henzinger, “Hyperlink analysis on the world wide web,” in <i>Proceedings
    of the 16th ACM conference on Hypertext and hypermedia</i>, Salzburg, Austria,
    2005, pp. 1–3.
  ista: 'Henzinger MH. 2005. Hyperlink analysis on the world wide web. Proceedings
    of the 16th ACM conference on Hypertext and hypermedia. HYPERTEXT: Conference
    on Hypertext and Hypermedia, 1–3.'
  mla: Henzinger, Monika H. “Hyperlink Analysis on the World Wide Web.” <i>Proceedings
    of the 16th ACM Conference on Hypertext and Hypermedia</i>, Association for Computing
    Machinery, 2005, pp. 1–3, doi:<a href="https://doi.org/10.1145/1083356.1083357">10.1145/1083356.1083357</a>.
  short: M.H. Henzinger, in:, Proceedings of the 16th ACM Conference on Hypertext
    and Hypermedia, Association for Computing Machinery, 2005, pp. 1–3.
conference:
  end_date: 2005-09-09
  location: Salzburg, Austria
  name: 'HYPERTEXT: Conference on Hypertext and Hypermedia'
  start_date: 2005-09-06
date_created: 2022-07-29T10:47:23Z
date_published: 2005-09-06T00:00:00Z
date_updated: 2023-02-09T11:54:40Z
day: '06'
doi: 10.1145/1083356.1083357
extern: '1'
keyword:
- Hyperlink Analysis
- World Wide Web
language:
- iso: eng
month: '09'
oa_version: None
page: 1-3
publication: Proceedings of the 16th ACM conference on Hypertext and hypermedia
publication_identifier:
  isbn:
  - '9781595931689'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Hyperlink analysis on the world wide web
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2005'
...
---
_id: '8516'
abstract:
- lang: eng
  text: "The purpose of this paper is to construct examples of diffusion for E-Hamiltonian
    perturbations\r\nof completely integrable Hamiltonian systems in 2d-dimensional
    phase space, with d large.\r\nIn the first part of the paper, simple and explicit
    examples are constructed illustrating absence\r\nof ‘long-time’ stability for
    size E Hamiltonian perturbations of quasi-convex integrable systems\r\nalready
    when the dimension 2d of phase space becomes as large as log 1/E . We first produce\r\nthe
    example in Gevrey class and then a real analytic one, with some additional work.\r\nIn
    the second part, we consider again E-Hamiltonian perturbations of completely integrable\r\nHamiltonian
    system in 2d-dimensional space with E-small but not too small, |E| > exp(−d),
    with\r\nd the number of degrees of freedom assumed large. It is shown that for
    a class of analytic\r\ntime-periodic perturbations, there exist linearly diffusing
    trajectories. The underlying idea for\r\nboth examples is similar and consists
    in coupling a fixed degree of freedom with a large\r\nnumber of them. The procedure
    and analytical details are however significantly different. As\r\nmentioned, the
    construction in Part I is totally elementary while Part II is more involved, relying\r\nin
    particular on the theory of normally hyperbolic invariant manifolds, methods of
    generating\r\nfunctions, Aubry–Mather theory, and Mather’s variational methods."
article_processing_charge: No
article_type: original
author:
- first_name: Jean
  full_name: Bourgain, Jean
  last_name: Bourgain
- first_name: Vadim
  full_name: Kaloshin, Vadim
  id: FE553552-CDE8-11E9-B324-C0EBE5697425
  last_name: Kaloshin
  orcid: 0000-0002-6051-2628
citation:
  ama: Bourgain J, Kaloshin V. On diffusion in high-dimensional Hamiltonian systems.
    <i>Journal of Functional Analysis</i>. 2005;229(1):1-61. doi:<a href="https://doi.org/10.1016/j.jfa.2004.09.006">10.1016/j.jfa.2004.09.006</a>
  apa: Bourgain, J., &#38; Kaloshin, V. (2005). On diffusion in high-dimensional Hamiltonian
    systems. <i>Journal of Functional Analysis</i>. Elsevier. <a href="https://doi.org/10.1016/j.jfa.2004.09.006">https://doi.org/10.1016/j.jfa.2004.09.006</a>
  chicago: Bourgain, Jean, and Vadim Kaloshin. “On Diffusion in High-Dimensional Hamiltonian
    Systems.” <i>Journal of Functional Analysis</i>. Elsevier, 2005. <a href="https://doi.org/10.1016/j.jfa.2004.09.006">https://doi.org/10.1016/j.jfa.2004.09.006</a>.
  ieee: J. Bourgain and V. Kaloshin, “On diffusion in high-dimensional Hamiltonian
    systems,” <i>Journal of Functional Analysis</i>, vol. 229, no. 1. Elsevier, pp.
    1–61, 2005.
  ista: Bourgain J, Kaloshin V. 2005. On diffusion in high-dimensional Hamiltonian
    systems. Journal of Functional Analysis. 229(1), 1–61.
  mla: Bourgain, Jean, and Vadim Kaloshin. “On Diffusion in High-Dimensional Hamiltonian
    Systems.” <i>Journal of Functional Analysis</i>, vol. 229, no. 1, Elsevier, 2005,
    pp. 1–61, doi:<a href="https://doi.org/10.1016/j.jfa.2004.09.006">10.1016/j.jfa.2004.09.006</a>.
  short: J. Bourgain, V. Kaloshin, Journal of Functional Analysis 229 (2005) 1–61.
date_created: 2020-09-18T10:49:06Z
date_published: 2005-12-01T00:00:00Z
date_updated: 2021-01-12T08:19:49Z
day: '01'
doi: 10.1016/j.jfa.2004.09.006
extern: '1'
intvolume: '       229'
issue: '1'
keyword:
- Analysis
language:
- iso: eng
month: '12'
oa_version: None
page: 1-61
publication: Journal of Functional Analysis
publication_identifier:
  issn:
  - 0022-1236
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: On diffusion in high-dimensional Hamiltonian systems
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 229
year: '2005'
...
---
_id: '11680'
abstract:
- lang: eng
  text: 'We present a model for edge updates with restricted randomness in dynamic
    graph algorithms and a general technique for analyzing the expected running time
    of an update operation. This model is able to capture the average case in many
    applications, since (1) it allows restrictions on the set of edges which can be
    used for insertions and (2) the type (insertion or deletion) of each update operation
    is arbitrary, i.e., not random. We use our technique to analyze existing and new
    dynamic algorithms for the following problems: maximum cardinality matching, minimum
    spanning forest, connectivity, 2-edge connectivity, k -edge connectivity, k -vertex
    connectivity, and bipartiteness. Given a random graph G with m 0 edges and n vertices
    and a sequence of l update operations such that the graph contains m i edges after
    operation i , the expected time for performing the updates for any l is O(llogn+∑li=1n/m−−√i)
    in the case of minimum spanning forests, connectivity, 2-edge connectivity, and
    bipartiteness. The expected time per update operation is O(n) in the case of maximum
    matching. We also give improved bounds for k -edge and k -vertex connectivity.
    Additionally we give an insertions-only algorithm for maximum cardinality matching
    with worst-case O(n) amortized time per insertion.'
acknowledgement: The authors would like to thank Emo Welzl for helpful discussions.
article_processing_charge: No
article_type: original
author:
- first_name: D.
  full_name: Alberts, D.
  last_name: Alberts
- 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: Alberts D, Henzinger MH. Average-case analysis of dynamic graph algorithms.
    <i>Algorithmica</i>. 1998;20:31-60. doi:<a href="https://doi.org/10.1007/pl00009186">10.1007/pl00009186</a>
  apa: Alberts, D., &#38; Henzinger, M. H. (1998). Average-case analysis of dynamic
    graph algorithms. <i>Algorithmica</i>. Springer Nature. <a href="https://doi.org/10.1007/pl00009186">https://doi.org/10.1007/pl00009186</a>
  chicago: Alberts, D., and Monika H Henzinger. “Average-Case Analysis of Dynamic
    Graph Algorithms.” <i>Algorithmica</i>. Springer Nature, 1998. <a href="https://doi.org/10.1007/pl00009186">https://doi.org/10.1007/pl00009186</a>.
  ieee: D. Alberts and M. H. Henzinger, “Average-case analysis of dynamic graph algorithms,”
    <i>Algorithmica</i>, vol. 20. Springer Nature, pp. 31–60, 1998.
  ista: Alberts D, Henzinger MH. 1998. Average-case analysis of dynamic graph algorithms.
    Algorithmica. 20, 31–60.
  mla: Alberts, D., and Monika H. Henzinger. “Average-Case Analysis of Dynamic Graph
    Algorithms.” <i>Algorithmica</i>, vol. 20, Springer Nature, 1998, pp. 31–60, doi:<a
    href="https://doi.org/10.1007/pl00009186">10.1007/pl00009186</a>.
  short: D. Alberts, M.H. Henzinger, Algorithmica 20 (1998) 31–60.
date_created: 2022-07-28T06:50:51Z
date_published: 1998-01-01T00:00:00Z
date_updated: 2023-02-21T16:33:27Z
day: '01'
doi: 10.1007/pl00009186
extern: '1'
intvolume: '        20'
keyword:
- Dynamic graph algorithm
- Average-case analysis
- Minimum spanning forest
- Connectivity
- Bipartiteness
- Maximum matching.
language:
- iso: eng
month: '01'
oa_version: None
page: 31-60
publication: Algorithmica
publication_identifier:
  eissn:
  - 1432-0541
  issn:
  - 0178-4617
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  record:
  - id: '11928'
    relation: earlier_version
    status: public
scopus_import: '1'
status: public
title: Average-case analysis of dynamic graph algorithms
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 20
year: '1998'
...
---
_id: '8528'
abstract:
- lang: eng
  text: "In the present paper, we give a definition of prevalent (\"metrically prevalent\"
    ) sets in nonlinear function\r\nspaces. A subset of a Euclidean space is said
    to be metrically prevalent if its complement has measure zero.\r\nThere is no
    natural way to generalize the definition of a set of measure zero in a finite-dimensional
    space\r\nto the infinite-dimensional case [6]. Therefore, it is necessary to give
    a special definition of a metrically\r\nprevalent set (set of full measure) in
    an infinite-dimensional space. There are various ways to do so. We\r\nsuggest
    one of the possible ways to define the class of metrically prevalent sets in the
    space of smooth maps\r\nof one smooth manifold into another. It is shown in this
    paper that the class of metrically prevalent sets\r\nhas natural properties; in
    particular, the intersection of finitely many metrically prevalent sets is metrically\r\nprevalent.
    The main result of the paper is a prevalent version of Thorn's transversality
    theorem.\r\nIt is common practice in singularity theory and the theory of dynamical
    systems to say that a property\r\nholds for \"almost every\" map (or flow) if
    it holds for a residual set, i.e., a set that contains a countable\r\nintersection
    of open dense sets in the corresponding function space. However, even in finite-dimensional\r\nspaces
    such a set can have arbitrarily small (say, zero) Lebesgue measure. We prove that
    Thorn's transversality theorem holds for an essentially \"thicker\" set than a
    residual set. It seems reasonable to revise from\r\nthe prevalent point of view
    the classical results of singularity theory and theory of dynamical systems,\r\nincluding
    the multijet transversality theorem, Mather's stability theorem, Kupka-Smale's
    theorem for dynamical systems, etc. We shall do this elsewhere. The notion of
    prevalence in linear Banach spaces was\r\nintroduced and investigated in [8].
    One of the possible ways to define a class of prevalent sets in the space\r\nof
    smooth maps of manifolds, which essentially differs from that presented in this
    paper, is given in [7].\r\nDefinitions of typicalness based on the Lebesgue measure
    in a finite-dimensional space were suggested\r\nby Kolmogorov [10] and Arnold
    [11]. These definitions were cited and discussed in [9]. Here we only point\r\nout
    that the finite-dimensional analog of Arnold's definition allows prevalent sets
    to have arbitrarily small\r\nmeasure, whereas the prevalent sets in the sense
    of the finite-dimensional analog of the definition given in\r\nthe present paper
    are necessarily of full measure. Our definition is a modification of that due
    to Arnold.\r\nI wish to thank Yu. S. Illyashenko for constant attention to this
    work and useful discussions and\r\nR. I. Bogdanov for help in the preparation
    of this paper. "
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. Prevalence in the space of finitely smooth maps. <i>Functional
    Analysis and Its Applications</i>. 1997;31(2):95-99. doi:<a href="https://doi.org/10.1007/bf02466014">10.1007/bf02466014</a>
  apa: Kaloshin, V. (1997). Prevalence in the space of finitely smooth maps. <i>Functional
    Analysis and Its Applications</i>. Springer Nature. <a href="https://doi.org/10.1007/bf02466014">https://doi.org/10.1007/bf02466014</a>
  chicago: Kaloshin, Vadim. “Prevalence in the Space of Finitely Smooth Maps.” <i>Functional
    Analysis and Its Applications</i>. Springer Nature, 1997. <a href="https://doi.org/10.1007/bf02466014">https://doi.org/10.1007/bf02466014</a>.
  ieee: V. Kaloshin, “Prevalence in the space of finitely smooth maps,” <i>Functional
    Analysis and Its Applications</i>, vol. 31, no. 2. Springer Nature, pp. 95–99,
    1997.
  ista: Kaloshin V. 1997. Prevalence in the space of finitely smooth maps. Functional
    Analysis and Its Applications. 31(2), 95–99.
  mla: Kaloshin, Vadim. “Prevalence in the Space of Finitely Smooth Maps.” <i>Functional
    Analysis and Its Applications</i>, vol. 31, no. 2, Springer Nature, 1997, pp.
    95–99, doi:<a href="https://doi.org/10.1007/bf02466014">10.1007/bf02466014</a>.
  short: V. Kaloshin, Functional Analysis and Its Applications 31 (1997) 95–99.
date_created: 2020-09-18T10:50:54Z
date_published: 1997-03-30T00:00:00Z
date_updated: 2021-01-12T08:19:54Z
day: '30'
doi: 10.1007/bf02466014
extern: '1'
intvolume: '        31'
issue: '2'
keyword:
- Applied Mathematics
- Analysis
language:
- iso: eng
month: '03'
oa_version: None
page: 95-99
publication: Functional Analysis and Its Applications
publication_identifier:
  issn:
  - 0016-2663
  - 1573-8485
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Prevalence in the space of finitely smooth maps
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 31
year: '1997'
...
---
_id: '6161'
abstract:
- lang: eng
  text: 'The tra-1 gene is a terminal regulator of somatic sex in Caenorhabditis elegans:
    high tra-1 activity elicits female development, low tra-1 activity elicits male
    development. To investigate the function and evolution of tra- 1, we examined
    the tra-1 gene from the closely related nematode C. briggsae. Ce-tra-1 and Cb-tra-1
    are unusually divergent. Each gene generates two transcripts, but only one of
    these is present in both species. This common transcript encodes TRA-1A, which
    shows only 44% amino acid identity between the species, a figure much lower than
    that for previously compared genes. A Cb-tra-1 transgene rescues many tissues
    of tra-1(null) mutants of C. elegans but not the somatic gonad or germ line. This
    transgene also causes nongonadal feminization of XO animals, indicating incorrect
    sexual regulation. Alignment of Ce-TRA-1A and Cb-TRA-1A defined several conserved
    regions likely to be important for tra-1 function. The phenotype differences between
    Ce-tra- 1(null) mutants rescued by Cb-tra-1 transgenes and wild-type C. elegans
    indicate significant divergence of regulatory regions. These molecular and functional
    studies suggest that evolution of sex determination in nematodes is rapid and
    genetically complex.'
author:
- first_name: Mario
  full_name: de Bono, Mario
  id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87
  last_name: de Bono
  orcid: 0000-0001-8347-0443
- first_name: J.
  full_name: Hodgkin, J.
  last_name: Hodgkin
citation:
  ama: 'de Bono M, Hodgkin J. Evolution of sex determination in Caenorhabditis: Unusually
    high divergence of tra-1 and its functional consequences. <i>Genetics</i>. 1996;144(2):587-595.'
  apa: 'de Bono, M., &#38; Hodgkin, J. (1996). Evolution of sex determination in Caenorhabditis:
    Unusually high divergence of tra-1 and its functional consequences. <i>Genetics</i>.
    Genetics Society of America.'
  chicago: 'Bono, Mario de, and J. Hodgkin. “Evolution of Sex Determination in Caenorhabditis:
    Unusually High Divergence of Tra-1 and Its Functional Consequences.” <i>Genetics</i>.
    Genetics Society of America, 1996.'
  ieee: 'M. de Bono and J. Hodgkin, “Evolution of sex determination in Caenorhabditis:
    Unusually high divergence of tra-1 and its functional consequences,” <i>Genetics</i>,
    vol. 144, no. 2. Genetics Society of America, pp. 587–595, 1996.'
  ista: 'de Bono M, Hodgkin J. 1996. Evolution of sex determination in Caenorhabditis:
    Unusually high divergence of tra-1 and its functional consequences. Genetics.
    144(2), 587–595.'
  mla: 'de Bono, Mario, and J. Hodgkin. “Evolution of Sex Determination in Caenorhabditis:
    Unusually High Divergence of Tra-1 and Its Functional Consequences.” <i>Genetics</i>,
    vol. 144, no. 2, Genetics Society of America, 1996, pp. 587–95.'
  short: M. de Bono, J. Hodgkin, Genetics 144 (1996) 587–595.
date_created: 2019-03-21T11:50:37Z
date_published: 1996-10-01T00:00:00Z
date_updated: 2021-01-12T08:06:28Z
day: '01'
extern: '1'
external_id:
  pmid:
  - '8889522'
intvolume: '       144'
issue: '2'
keyword:
- amino acid sequence
- article
- caenorhabditis elegans
- evolution
- genetic variability
- nonhuman
- priority journal
- sex determination
- Amino Acid Sequence
- Animals
- Animals
- Genetically Modified
- Base Sequence
- Caenorhabditis
- Caenorhabditis elegans
- Caenorhabditis elegans Proteins
- DNA
- Helminth
- DNA-Binding Proteins
- Evolution
- Molecular
- Female
- Helminth Proteins
- Membrane Proteins
- Molecular Sequence Data
- Mutagenesis
- RNA
- Messenger
- Sequence Homology
- Amino Acid
- Sex Determination (Analysis)
- Transcription Factors
- Transgenes
- Turner Syndrome
- Animalia
- Caenorhabditis
- Caenorhabditis briggsae
- Caenorhabditis elegans
- Nematoda
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1207552/
month: '10'
oa: 1
oa_version: Published Version
page: 587-595
pmid: 1
publication: Genetics
publication_identifier:
  issn:
  - '00166731'
publication_status: published
publisher: Genetics Society of America
quality_controlled: '1'
status: public
title: 'Evolution of sex determination in Caenorhabditis: Unusually high divergence
  of tra-1 and its functional consequences'
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 144
year: '1996'
...
