Search results for "Complete"
showing 10 items of 490 documents
Wardowski conditions to the coincidence problem
2015
In this article we first discuss the existence and uniqueness of a solution for the coincidence problem: Find p ∈ X such that Tp = Sp, where X is a nonempty set, Y is a complete metric space, and T, S:X → Y are two mappings satisfying a Wardowski type condition of contractivity. Later on, we will state the convergence of the Picard-Juncgk iteration process to the above coincidence problem as well as a rate of convergence for this iteration scheme. Finally, we shall apply our results to study the existence and uniqueness of a solution as well as the convergence of the Picard-Juncgk iteration process toward the solution of a second order differential equation. Ministerio de Economía y Competi…
Estimating completeness in cancer registries--comparing capture-recapture methods in a simulation study.
2008
Completeness of registration is one of the quality indicators usually reported by cancer registries. This allows researchers to assess how useful and representative the data is. Several methods have been suggested to estimate completeness. In this paper a multi-state model for the process of cancer diagnosis and treatment is presented. In principle, every contact with a doctor during diagnosis, treatment, and aftercare can give rise to a cancer registry notification with a certain probability. Therefore the states included in the model are "incident tumour" and "death" but also contacts with doctors such as consultation of a general practitioner or specialised doctor, diagnostic procedures,…
Grover Search with Lackadaisical Quantum Walks
2015
The lazy random walk, where the walker has some probability of staying put, is a useful tool in classical algorithms. We propose a quantum analogue, the lackadaisical quantum walk, where each vertex is given $l$ self-loops, and we investigate its effects on Grover's algorithm when formulated as search for a marked vertex on the complete graph of $N$ vertices. For the discrete-time quantum walk using the phase flip coin, adding a self-loop to each vertex boosts the success probability from 1/2 to 1. Additional self-loops, however, decrease the success probability. Using instead the Ambainis, Kempe, and Rivosh (2005) coin, adding self-loops simply slows down the search. These coins also diffe…
Quantum Walk Search on Johnson Graphs
2016
The Johnson graph $J(n,k)$ is defined by $n$ symbols, where vertices are $k$-element subsets of the symbols, and vertices are adjacent if they differ in exactly one symbol. In particular, $J(n,1)$ is the complete graph $K_n$, and $J(n,2)$ is the strongly regular triangular graph $T_n$, both of which are known to support fast spatial search by continuous-time quantum walk. In this paper, we prove that $J(n,3)$, which is the $n$-tetrahedral graph, also supports fast search. In the process, we show that a change of basis is needed for degenerate perturbation theory to accurately describe the dynamics. This method can also be applied to general Johnson graphs $J(n,k)$ with fixed $k$.
The Power of Word-Frequency Based Alignment-Free Functions: a Comprehensive Large-Scale Experimental Analysis
2021
Abstract Motivation Alignment-free (AF) distance/similarity functions are a key tool for sequence analysis. Experimental studies on real datasets abound and, to some extent, there are also studies regarding their control of false positive rate (Type I error). However, assessment of their power, i.e. their ability to identify true similarity, has been limited to some members of the D2 family. The corresponding experimental studies have concentrated on short sequences, a scenario no longer adequate for current applications, where sequence lengths may vary considerably. Such a State of the Art is methodologically problematic, since information regarding a key feature such as power is either mi…
The 1970 US Draft Lottery Revisited: A Spatial Analysis
2004
Summary We revise the result of the 1970 selective service draft lottery in the USA following an open question that was suggested by Fienberg in a paper published in Science in 1971. The result of the drawings can be viewed as a particular spatial pattern which can be analysed by using general spatial tools adapted to our context. Approaches for assessing the complete spatial randomness for this spatial process on a finite support are proposed. More specifically, these approaches involve the number of events in a square window and a k(r)-based function used to analyse stationary spatial point processes.
Estimation of total electricity consumption curves by sampling in a finite population when some trajectories are partially unobserved
2019
International audience; Millions of smart meters that are able to collect individual load curves, that is, electricity consumption time series, of residential and business customers at fine scale time grids are now deployed by electricity companies all around the world. It may be complex and costly to transmit and exploit such a large quantity of information, therefore it can be relevant to use survey sampling techniques to estimate mean load curves of specific groups of customers. Data collection, like every mass process, may undergo technical problems at every point of the metering and collection chain resulting in missing values. We consider imputation approaches (linear interpolation, k…
Approachability in Population Games
2014
This paper reframes approachability theory within the context of population games. Thus, whilst one player aims at driving her average payoff to a predefined set, her opponent is not malevolent but rather extracted randomly from a population of individuals with given distribution on actions. First, convergence conditions are revisited based on the common prior on the population distribution, and we define the notion of \emph{1st-moment approachability}. Second, we develop a model of two coupled partial differential equations (PDEs) in the spirit of mean-field game theory: one describing the best-response of every player given the population distribution (this is a \emph{Hamilton-Jacobi-Bell…
Clerodane diterpenoids from Salvia splendens.
2006
Four new clerodane diterpenoids, salvisplendins A-D (1-4), have been isolated from an acetone extract of the flowers of SalVia splendens, together with an artifact (5), arising from salvisplendin D (4) by addition of diazomethane, and the already known clerodane olearin (6). The structures of the new compounds (1-5) were established mainly by 1D and 2D NMR spectroscopic studies and, in the case of salvisplendin A (1), by chemical correlation with splenolide B (7). Complete 1H and 13C NMR assignments for olearin (6), not published hitherto, are also reported.
A Behavioral Approach for Logistics System Analysis and Design: A Reverse Logistics Case
2002
Traditional logistic system analysis quite often assumes a single decisionmaker (the planner) operating in a state of complete information and full decision power. He pursues the objective of designing an efficient logistic network by solving a sequence of operational problems mainly in the form of optimization models. More realistically, one should consider that the decision power is actually distributed within the logistics system among different actors (agents or holons) having different (conflictual or cooperative) goals, following different behavioural rules and generating interdipendencies. The shift from a SAS (single-agent system) approach to a MAS (multi-agent system) one induces s…