Search results for "COMPLETENESS"
showing 10 items of 66 documents
Automatic construction of test sets: Theoretical approach
2005
We consider the problem of automatic construction of complete test set (CTS) from program text. The completeness criterion adopted is C1, i.e., it is necessary to execute all feasible branches of program at least once on the tests of CTS. A simple programming language is introduced with the property that the values used in conditional statements are not arithmetically deformed. For this language the CTS problem is proved to be algorithmically solvable and CTS construction algorithm is obtained. Some generalizations of this language containing counters, stacks or arrays are considered where the CTS problem remains solvable. In conclusion the applications of the obtained results to CTS constr…
Speeding up of microstructure reconstruction: I. Application to labyrinth patterns
2011
Recently, entropic descriptors based the Monte Carlo hybrid reconstruction of the microstructure of a binary/greyscale pattern has been proposed (Piasecki 2011 Proc. R. Soc. A 467 806). We try to speed up this method applied in this instance to the reconstruction of a binary labyrinth target. Instead of a random configuration, we propose to start with a suitable synthetic pattern created by cellular automaton. The occurrence of the characteristic attributes of the target is the key factor for reducing the computational cost that can be measured by the total number of MC steps required. For the same set of basic parameters, we investigated the following simulation scenarios: the biased/rando…
A note on best approximation in 0-complete partial metric spaces
2014
We study the existence and uniqueness of best proximity points in the setting of 0-complete partial metric spaces. We get our results by showing that the generalizations, which we have to consider, are obtained from the corresponding results in metric spaces. We introduce some new concepts and consider significant theorems to support this fact.
Common Fixed Points in a Partially Ordered Partial Metric Space
2013
In the first part of this paper, we prove some generalized versions of the result of Matthews in (Matthews, 1994) using different types of conditions in partially ordered partial metric spaces for dominated self-mappings or in partial metric spaces for self-mappings. In the second part, using our results, we deduce a characterization of partial metric 0-completeness in terms of fixed point theory. This result extends the Subrahmanyam characterization of metric completeness.
Basis-set completeness profiles in two dimensions
2002
A two-electron basis-set completeness profile is proposed by analogy with the one-electron profile introduced by D. P. Chong (Can J Chem 1995, 73, 79). It is defined as Y(alpha, beta) = sigmam sigman (Galpha(1)Gbeta(2)/(1/r12)/ psim(1)psin(2)) (psim(1)psin(2)/r12/Galpha(1)Gp(2)) and motivated by the expression for the basis-set truncation correction that occurs in the framework of explicitly correlated methods (Galpha is a scanning Gaussian-type orbital of exponent alpha and [psim] is the orthonormalized one-electron basis under study). The two-electron basis-set profiles provide a visual assessment of the suitability of basis sets to describe electron-correlation effects. Furthermore, they…
NP-completeness of the hamming salesman problem
1985
It is shown that the traveling salesman problem, where cities are bit strings with Hamming distances, is NP-complete.
Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time
2002
This article presents two algebraic characterizations and two related complete problems for the complexity class DLIN that was introduced in [E. Grandjean, Ann. Math. Artif. Intell., 16 (1996), pp. 183--236]. DLIN is essentially the class of all functions that can be computed in linear time on a Random Access Machine which uses only numbers of linear value during its computations. The algebraic characterizations are in terms of recursion schemes that define unary functions. One of these schemes defines several functions simultaneously, while the other one defines only one function. From the algebraic characterizations, we derive two complete problems for DLIN under new, very strict, and mac…
Closedness and lower semicontinuity of positive sesquilinear forms
2009
The relationship between the notion of closedness, lower semicontinuity and completeness (of a quotient) of the domain of a positive sesquilinear form defined on a subspace of a topological vector space is investigated and sufficient conditions for their equivalence are given.
Fixed points and completeness on partial metric spaces
2015
Recently, Suzuki [T. Suzuki, A generalized Banach contraction principle that characterizes metric completeness, Proc. Amer. Math. Soc. 136 (2008), 1861-1869] proved a fixed point theorem that is a generalization of the Banach contraction principle and characterizes the metric completeness. Paesano and Vetro [D. Paesano and P. Vetro, Suzuki's type characterizations of completeness for partial metric spaces and fixed points for partially ordered metric spaces, Topology Appl., 159 (2012), 911-920] proved an analogous fixed point result for a selfmapping on a partial metric space that characterizes the partial metric 0-completeness. In this paper we prove a fixed point result for a new class of…
Suzukiʼs type characterizations of completeness for partial metric spaces and fixed points for partially ordered metric spaces
2012
Abstract Recently, Suzuki [T. Suzuki, A generalized Banach contraction principle that characterizes metric completeness, Proc. Amer. Math. Soc. 136 (2008) 1861–1869] proved a fixed point theorem that is a generalization of the Banach contraction principle and characterizes the metric completeness. In this paper we prove an analogous fixed point result for a self-mapping on a partial metric space or on a partially ordered metric space. Our results on partially ordered metric spaces generalize and extend some recent results of Ran and Reurings [A.C.M. Ran, M.C. Reurings, A fixed point theorem in partially ordered sets and some applications to matrix equations, Proc. Amer. Math. Soc. 132 (2004…