8 resultados para Boolean Functions, Equivalence Class
Resumo:
A disadvantage of multiple-choice tests is that students have incentives to guess. To discourage guessing, it is common to use scoring rules that either penalize wrong answers or reward omissions. These scoring rules are considered equivalent in psychometrics, although experimental evidence has not always been consistent with this claim. We model students' decisions and show, first, that equivalence holds only under risk neutrality and, second, that the two rules can be modified so that they become equivalent even under risk aversion. This paper presents the results of a field experiment in which we analyze the decisions of subjects taking multiple-choice exams. The evidence suggests that differences between scoring rules are due to risk aversion as theory predicts. We also find that the number of omitted items depends on the scoring rule, knowledge, gender and other covariates.
Resumo:
Some results on fixed points related to the contractive compositions of bounded operators in a class of complete metric spaces which can be also considered as Banach's spaces are discussed through the paper. The class of composite operators under study can include, in particular, sequences of projection operators under, in general, oblique projective operators. In this paper we are concerned with composite operators which include sequences of pairs of contractive operators involving, in general, oblique projection operators. The results are generalized to sequences of, in general, nonconstant bounded closed operators which can have bounded, closed, and compact limit operators, such that the relevant composite sequences are also compact operators. It is proven that in both cases, Banach contraction principle guarantees the existence of unique fixed points under contractive conditions.
Resumo:
This paper relies on the study of fixed points and best proximity points of a class of so-called generalized point-dependent (K-Lambda)hybrid p-cyclic self-mappings relative to a Bregman distance Df, associated with a Gâteaux differentiable proper strictly convex function f in a smooth Banach space, where the real functions Lambda and K quantify the point-to-point hybrid and nonexpansive (or contractive) characteristics of the Bregman distance for points associated with the iterations through the cyclic self-mapping.Weak convergence results to weak cluster points are obtained for certain average sequences constructed with the iterates of the cyclic hybrid self-mappings.
Resumo:
12 p.
Resumo:
This paper investigates a class of self-adjoint compact operators in Hilbert spaces related to their truncated versions with finite-dimensional ranges. The comparisons are established in terms of worst-case norm errors of the composite operators generated from iterated computations. Some boundedness properties of the worst-case norms of the errors in their respective fixed points in which they exist are also given. The iterated sequences are expanded in separable Hilbert spaces through the use of numerable orthonormal bases.
Resumo:
This paper is focused on the study of the important property of the asymptotic hyperstability of a class of continuous-time dynamic systems. The presence of a parallel connection of a strictly stable subsystem to an asymptotically hyperstable one in the feed-forward loop is allowed while it has also admitted the generation of a finite or infinite number of impulsive control actions which can be combined with a general form of nonimpulsive controls. The asymptotic hyperstability property is guaranteed under a set of sufficiency-type conditions for the impulsive controls.
Resumo:
We present a prototype that implements a set of logical rules to prove the satis ability for a class of speci cations on XML documents. Speci cations are given by means of constraints built on Boolean XPath patterns. The main goal of this tool is to test if a given speci cation is satis able or not, showing the history of the execution. It can also be used to test if a given document is a model of a given speci cation and, as a subproduct, it allows to look for all the relations (monomorphisms) between two patterns or the result of doing some operations by combining patterns in di erent ways. The results of these operations are visually shown and therefore the tool makes these operations more understandable. The implementation of the algorithm has been written in Prolog but the prototype has a Java interface for an easy and friendly use.
Resumo:
35 p.