Search results for " Retrieval"

Fallzahlplanung bei ophthalmologischen Studien*

2000

An essential aspect in the cooperation of clinic and biometry consists in designing of studies, e.g. during the preparation of grant applications or for review by official drug surveillance institutions. A central aspect in study planning is the design-adequate and well-documented prediction of sample size, which should be recommended for any intended study. Based on several examples for sample size planning in study designs, which are of common relevance for ophthalmology, guidelines are derived to enable clinical researchers to perform sample size planning on their own. The latter can be based on the various available software packages for sample size prediction.

Distance Functions, Clustering Algorithms and Microarray Data Analysis

2010

Distance functions are a fundamental ingredient of classification and clustering procedures, and this holds true also in the particular case of microarray data. In the general data mining and classification literature, functions such as Euclidean distance or Pearson correlation have gained their status of de facto standards thanks to a considerable amount of experimental validation. For microarray data, the issue of which distance function works best has been investigated, but no final conclusion has been reached. The aim of this extended abstract is to shed further light on that issue. Indeed, we present an experimental study, involving several distances, assessing (a) their intrinsic sepa…

Studying Utility of Personal Usage-History: A Software Tool for Enabling Empirical Research

2007

Managing personal information space and working context is complicated in computerized environment. One well-known cause for the problem is that digital information is superficially fragmented into different data types and structures. Several unifying approaches have been proposed to facilitate semantic connections between them. Particularly in personal information retrieval, temporal information has turned to be useful. Hence, in this article, we present an empirical research setting for studying the utility of representing personal usage-history in information retrieval by comparing it with more traditional hierarchical representation. The research setting is based on a software Tool that…

2018

This article explores promising points of contact between philosophy and the expanding field of virtual reality research. Aiming at an interdisciplinary audience, it proposes a series of new research targets by presenting a range of concrete examples characterized by high theoretical relevance and heuristic fecundity. Among these examples are conscious experience itself, “Bayesian” and social VR, amnestic re-embodiment, merging human-controlled avatars and virtual agents, virtual ego-dissolution, controlling the reality/virtuality continuum, the confluence of VR and artificial intelligence (AI) as well as of VR and functional magnetic resonance imaging (fMRI), VR-based social hallucinations…

The meaning of biological signals.

2020

We introduce the virtual special issue on content in signalling systems. The issue explores the uses and limits of ideas from evolutionary game theory and information theory for explaining the content of biological signals. We explain the basic idea of the Lewis-Skyrms sender-receiver framework, and we highlight three key themes of the issue: (i) the challenge of accounting for deception, misinformation and false content, (ii) the relevance of partial or total common interest to the evolution of meaningful signals, and (iii) how the sender-receiver framework relates to teleosemantics.

Semantic and topological classification of images in magnetically guided capsule endoscopy

2012

International audience; Magnetically-guided capsule endoscopy (MGCE) is a nascent technology with the goal to allow the steering of a capsule endoscope inside a water filled stomach through an external magnetic field. We developed a classification cascade for MGCE images with groups images in semantic and topological categories. Results can be used in a post-procedure review or as a starting point for algorithms classifying pathologies. The first semantic classification step discards over-/under-exposed images as well as images with a large amount of debris. The second topological classification step groups images with respect to their position in the upper gastrointestinal tract (mouth, es…

Ranking and unrankingk-ary trees with a 4k –4 letter alphabet

1997

Abstract The problem of the direct generation in A-order of binary trees was stated by Zaks in 1980. In 1988 Roelants van Baronaigien and Ruskey gave a solution for k-ary trees with n internal nodes using an encoding sequence of kn+1 integers between 1 and n. Vajnovszki and Pallo improved this result for binary trees in 1994 using words of length n–1 on a four letter alphabet. Recently Korsh generalized the Vajnovszki and Pallo’s generating algorithm to k-ary trees using an alphabet whose cardinality depends on k but not on n. We give in this paper ranking and unranking algorithms for k-ary trees using the Korsh’s encoding scheme.

Periodic Orbits in the Isosceles Three-Body Problem

1991

The Saturn’s satellites Janus and Epimetheus are the first known bodies in the Solar System that has horseshoe orbits in a frame that rotates with uniform angular velocity. Both satellites have similar masses and orbital elements when they are far from one another. Moreover, their orbits are nearly symmetric. In fact, in the past, they have been identify as a unique satellite and afterwards, some mathematical theories about their orbits has been necessaries to understand why they do not collide. In particular, the interest in planar three-body problem with two small masses has increased6. We assume that the two small masses have similar symmetric initial conditions. The aim of this paper is…

Quantum Queries on Permutations

2015

K. Iwama and R. Freivalds considered query algorithms where the black box contains a permutation. Since then several authors have compared quantum and deterministic query algorithms for permutations. It turns out that the case of \(n\)-permutations where \(n\) is an odd number is difficult. There was no example of a permutation problem where quantization can save half of the queries for \((2m+1)\)-permutations if \(m\ge 2\). Even for \((2m)\)-permutations with \(m\ge 2\), the best proved advantage of quantum query algorithms is the result by Iwama/Freivalds where the quantum query complexity is \(m\) but the deterministic query complexity is \((2m-1)\). We present a group of \(5\)-permutati…

Outcomes of in-bag transvaginal extraction in a series of 692 laparoscopic myomectomies: results from a large retrospective analysis

2022

Transvaginal extraction is a feasible method to remove surgical specimen. In this study, we aim to report our experience with in-bag transvaginal specimen retrieval after laparoscopic myomectomy over the past 15 years.Single-center retrospective analysis.Academic hospital.Women who underwent laparoscopic myomectomy from January 2005 to April 2021.Posterior colpotomy and in-bag transvaginal extraction of the surgical specimen.We collected and analyzed data about patients' characteristics, main indication for surgery, and intra- and postoperative (within 30 days) complications.A total of 692 women underwent transvaginal specimen retrieval after laparoscopic myomectomy (mean largest myoma diam…