@misc{5582, abstract = {Data on Austrian open access publication output at Taylor&Francis from 2013-2017 including data analysis.}, author = {Villányi, Márton}, keywords = {Publication analysis, Bibliography, Open Access}, publisher = {Institute of Science and Technology Austria}, title = {{Taylor&Francis Austrian Publications 2013-2017}}, doi = {10.15479/AT:ISTA:94}, year = {2018}, } @misc{6459, author = {Petritsch, Barbara}, keywords = {Open Access, Publication Analysis}, location = {Graz, Austria}, publisher = {IST Austria}, title = {{Open Access at IST Austria 2009-2017}}, doi = {10.5281/zenodo.1410279}, year = {2018}, } @unpublished{11633, abstract = {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.}, author = {Bugnet, Lisa Annabelle and Garcia, R. A. and Davies, G. R. and Mathur, S. and Corsaro, E.}, booktitle = {arXiv}, keywords = {asteroseismology - methods, data analysis - stars, oscillations}, title = {{FliPer: Checking the reliability of global seismic parameters from automatic pipelines}}, doi = {10.48550/arXiv.1711.02890}, year = {2017}, } @article{10396, abstract = {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.}, author = {Schlögl, Alois and Jonas, Peter M and Schmidt-Hieber, C. and Guzman, S. J.}, issn = {1862-278X}, journal = {Biomedical Engineering / Biomedizinische Technik}, keywords = {biomedical engineering, data analysis, free software}, location = {Graz, Austria}, number = {SI-1-Track-G}, publisher = {De Gruyter}, title = {{Stimfit: A fast visualization and analysis environment for cellular neurophysiology}}, doi = {10.1515/bmt-2013-4181}, volume = {58}, year = {2013}, } @inproceedings{9943, abstract = {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.}, author = {Sommer, Christoph M and Straehle, Christoph and Köthe, Ullrich and Hamprecht, Fred A.}, booktitle = {2011 IEEE International Symposium on Biomedical Imaging: from Nano to Micro}, isbn = {978-1-4244-4127-3}, issn = {1945-8452}, keywords = {image segmentation, biomedical imaging, three dimensional displays, neurons, retina, observers, image color analysis}, location = {Chicago, Illinois, USA}, publisher = {Institute of Electrical and Electronics Engineers}, title = {{Ilastik: Interactive learning and segmentation toolkit}}, doi = {10.1109/isbi.2011.5872394}, year = {2011}, } @inproceedings{11698, abstract = {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.}, author = {Henzinger, Monika H}, booktitle = {Proceedings of the 16th ACM conference on Hypertext and hypermedia}, isbn = {9781595931689}, keywords = {Hyperlink Analysis, World Wide Web}, location = {Salzburg, Austria}, pages = {1--3}, publisher = {Association for Computing Machinery}, title = {{Hyperlink analysis on the world wide web}}, doi = {10.1145/1083356.1083357}, year = {2005}, } @article{8516, abstract = {The purpose of this paper is to construct examples of diffusion for E-Hamiltonian perturbations of completely integrable Hamiltonian systems in 2d-dimensional phase space, with d large. In the first part of the paper, simple and explicit examples are constructed illustrating absence of ‘long-time’ stability for size E Hamiltonian perturbations of quasi-convex integrable systems already when the dimension 2d of phase space becomes as large as log 1/E . We first produce the example in Gevrey class and then a real analytic one, with some additional work. In the second part, we consider again E-Hamiltonian perturbations of completely integrable Hamiltonian system in 2d-dimensional space with E-small but not too small, |E| > exp(−d), with d the number of degrees of freedom assumed large. It is shown that for a class of analytic time-periodic perturbations, there exist linearly diffusing trajectories. The underlying idea for both examples is similar and consists in coupling a fixed degree of freedom with a large number of them. The procedure and analytical details are however significantly different. As mentioned, the construction in Part I is totally elementary while Part II is more involved, relying in particular on the theory of normally hyperbolic invariant manifolds, methods of generating functions, Aubry–Mather theory, and Mather’s variational methods.}, author = {Bourgain, Jean and Kaloshin, Vadim}, issn = {0022-1236}, journal = {Journal of Functional Analysis}, keywords = {Analysis}, number = {1}, pages = {1--61}, publisher = {Elsevier}, title = {{On diffusion in high-dimensional Hamiltonian systems}}, doi = {10.1016/j.jfa.2004.09.006}, volume = {229}, year = {2005}, } @article{11680, abstract = {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.}, author = {Alberts, D. and Henzinger, Monika H}, issn = {1432-0541}, journal = {Algorithmica}, keywords = {Dynamic graph algorithm, Average-case analysis, Minimum spanning forest, Connectivity, Bipartiteness, Maximum matching.}, pages = {31--60}, publisher = {Springer Nature}, title = {{Average-case analysis of dynamic graph algorithms}}, doi = {10.1007/pl00009186}, volume = {20}, year = {1998}, } @article{8528, abstract = {In the present paper, we give a definition of prevalent ("metrically prevalent" ) sets in nonlinear function spaces. A subset of a Euclidean space is said to be metrically prevalent if its complement has measure zero. There is no natural way to generalize the definition of a set of measure zero in a finite-dimensional space to the infinite-dimensional case [6]. Therefore, it is necessary to give a special definition of a metrically prevalent set (set of full measure) in an infinite-dimensional space. There are various ways to do so. We suggest one of the possible ways to define the class of metrically prevalent sets in the space of smooth maps of one smooth manifold into another. It is shown in this paper that the class of metrically prevalent sets has natural properties; in particular, the intersection of finitely many metrically prevalent sets is metrically prevalent. The main result of the paper is a prevalent version of Thorn's transversality theorem. It is common practice in singularity theory and the theory of dynamical systems to say that a property holds for "almost every" map (or flow) if it holds for a residual set, i.e., a set that contains a countable intersection of open dense sets in the corresponding function space. However, even in finite-dimensional spaces 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 the prevalent point of view the classical results of singularity theory and theory of dynamical systems, including 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 introduced and investigated in [8]. One of the possible ways to define a class of prevalent sets in the space of smooth maps of manifolds, which essentially differs from that presented in this paper, is given in [7]. Definitions of typicalness based on the Lebesgue measure in a finite-dimensional space were suggested by Kolmogorov [10] and Arnold [11]. These definitions were cited and discussed in [9]. Here we only point out that the finite-dimensional analog of Arnold's definition allows prevalent sets to have arbitrarily small measure, whereas the prevalent sets in the sense of the finite-dimensional analog of the definition given in the present paper are necessarily of full measure. Our definition is a modification of that due to Arnold. I wish to thank Yu. S. Illyashenko for constant attention to this work and useful discussions and R. I. Bogdanov for help in the preparation of this paper. }, author = {Kaloshin, Vadim}, issn = {0016-2663}, journal = {Functional Analysis and Its Applications}, keywords = {Applied Mathematics, Analysis}, number = {2}, pages = {95--99}, publisher = {Springer Nature}, title = {{Prevalence in the space of finitely smooth maps}}, doi = {10.1007/bf02466014}, volume = {31}, year = {1997}, } @article{6161, abstract = {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 = {de Bono, Mario and Hodgkin, J.}, issn = {00166731}, journal = {Genetics}, keywords = {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}, number = {2}, pages = {587--595}, publisher = {Genetics Society of America}, title = {{Evolution of sex determination in Caenorhabditis: Unusually high divergence of tra-1 and its functional consequences}}, volume = {144}, year = {1996}, }