Search results for "retrieval"
showing 10 items of 1176 documents
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…
The Role of Sourcing in Discourse Comprehension
2017
This chapter provides a theoretical background by discussing different frameworks relevant for understanding the role of sourcing in discourse comprehension. It reviews empirical work on students' sourcing skills and the role of individual and contextual factors in sourcing and discusses the nature and particular challenges of sourcing in digital contexts and review research on sourcing in such contexts. The chapter analyses intervention work aiming to improve students' consideration and evaluation of source features when dealing with multiple documents and also reviews measures used to assess sourcing skills in the research literature. Developmental psychology research on social cognition …
Consumers’ acceptance of information and communications technology in tourism: A review
2017
The review provides a conceptual framework on e-tourism research.Research on e-tourism is grouped into three classifications.Research on these three groups are uneven.Synthesis of theories, theories and frameworks provided. The impact of information and communications technology (ICT) in tourism (e-tourism) has altered the ways tourism services are accessed and consumed. Ubiquitous and highly innovative ICTs provide different channels for consumers to use tourism services; thus, studies on e-tourism are numerous and fragmented. Different factors account for how consumers embrace these channels. The purpose of this study is to review studies on consumers acceptance or adoption of e-tourism i…
Creating a semantically-enhanced cloud services environment through ontology evolution
2014
Currently, the availability of Web resources has grown enormously to the point that whatever a user needs at a given moment can potentially be found on the Internet. These resources are not limited to data items anymore, functionality delivered through some sort of service architectural model is also offered on the Internet. In the last few years, cloud computing has emerged as one of the most popular computing models to provide services over the Internet. However, as the number of available cloud services increases, the problem of service discovery and selection arises. Experience indicates that semantic technologies can provide the basis for enhanced and more precise search processes. In …
Upport vector machines for nonlinear kernel ARMA system identification.
2006
Nonlinear system identification based on support vector machines (SVM) has been usually addressed by means of the standard SVM regression (SVR), which can be seen as an implicit nonlinear autoregressive and moving average (ARMA) model in some reproducing kernel Hilbert space (RKHS). The proposal of this letter is twofold. First, the explicit consideration of an ARMA model in an RKHS (SVM-ARMA 2k) is proposed. We show that stating the ARMA equations in an RKHS leads to solving the regularized normal equations in that RKHS, in terms of the autocorrelation and cross correlation of the (nonlinearly) transformed input and output discrete time processes. Second, a general class of SVM-based syste…
Average Performance Analysis of the Stochastic Gradient Method for Online PCA
2019
International audience; This paper studies the complexity of the stochastic gradient algorithm for PCA when the data are observed in a streaming setting. We also propose an online approach for selecting the learning rate. Simulation experiments confirm the practical relevance of the plain stochastic gradient approach and that drastic improvements can be achieved by learning the learning rate.
Kernel manifold alignment for domain adaptation
2016
The wealth of sensory data coming from different modalities has opened numerous opportu- nities for data analysis. The data are of increasing volume, complexity and dimensionality, thus calling for new methodological innovations towards multimodal data processing. How- ever, multimodal architectures must rely on models able to adapt to changes in the data dis- tribution. Differences in the density functions can be due to changes in acquisition conditions (pose, illumination), sensors characteristics (number of channels, resolution) or different views (e.g. street level vs. aerial views of a same building). We call these different acquisition modes domains, and refer to the adaptation proble…