5 resultados para Equivalence Proof
em Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco
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:
Published as an article in: Studies in Nonlinear Dynamics & Econometrics, 2004, vol. 8, issue 1, pages 5.
Resumo:
In 1972, Maschler, Peleg and Shapley proved that in the class of convex the nucleolus and the kernel coincide. The only aim of this note is to provide a shorter, alternative proof of this result.
Resumo:
Impact detection in aeronautical structures allows predicting their future reliability and performance. An impact can produce microscopic fissures that could evolve into fractures or even the total collapse of the structure, so it is important to know the location and severity of each impact. For this purpose, optical fibers with Bragg gratings are used to analyze each impact and the vibrations generated by them. In this paper it is proven that optical fibers with Bragg gratings can be used to detect impacts, and also that a high-frequency interrogator is necessary to collect valuable information about the impacts. The use of two interrogators constitutes the main novelty of this paper.
Resumo:
We consider the quanti fied constraint satisfaction problem (QCSP) which is to decide, given a structure and a first-order sentence (not assumed here to be in prenex form) built from conjunction and quanti fication, whether or not the sentence is true on the structure. We present a proof system for certifying the falsity of QCSP instances and develop its basic theory; for instance, we provide an algorithmic interpretation of its behavior. Our proof system places the established Q-resolution proof system in a broader context, and also allows us to derive QCSP tractability results.