Existing captcha solutions on the Internet are a major source of user frustration. Game captchas are an interesting and, to date, little-studied approach claiming to make captcha solving a fun activity for the users. One broad form of such captchas – called Dynamic Cognitive Game (DCG) captchas – challenge the user to perform a game-like cognitive task interacting with a series of dynamic image...

Linear NDCG is used for measuring the performance of the Web content quality assessment in ECML/PKDD Discovery Challenge 2010. In this paper, we will prove that the DCG error equals a new pair-wise loss.

To be definite we shall consider the problem of critical fluctuations with the purpose of illustrating their relevance in the analysis of other difficult problems like field theory.

We propose an algorithm to locate an object with unknown coordinates based on the positive semi-definite programming in the wireless sensor networks, assuming that the squared error of the measured distance follows Gaussian distribution. We first obtain the estimator of the object location; then transform the non-convex problem to convex one by the positive semi-definite relaxation; and finally...

statement of the problem malocclusion is a developmental problem, which results in social, psychological and functional problems for patients purpose the aim of this study was to evaluate the need for orthodontic treatment using the index of orthodontic treatment need (iotn) among the 11‒14-year-old students of hamadan schools in 2010 and to find the correlation between dental health component ...

This paper presents a construction and the analysis of class non-Gaussian positive-definite matrix-valued homogeneous random fields with uncertain spectral measure for stochastic elliptic operators. Then boundary value problem in bounded domain 3D-space is introduced analyzed homogenization.

We study the syntactic complexity of finite/cofinite, definite and reverse definite languages. The syntactic complexity of a class of languages is defined as the maximal size of syntactic semigroups of languages from the class, taken as a function of the state complexity n of the languages. We prove that (n − 1)! is a tight upper bound for finite/cofinite languages and that it can be reached on...

this study investigated the relative effects of deductive and inductive form-focused instruction (ffi) on the acquisition of 4 non-generic definite article uses(cultural, situational, structural, and textual) as assessed by explicit and implicit outcome measures. the tests utilized to assess efl learners' acquisition of definite article uses were timed and untimed grammaticality judgment tests....

A backward error analysis for the orthogonal factorization method for equality constrained quadratic programming problems has been developed. Furthermore, this method has been experimentally compared with direct elimination method on a class of test problems. 1 Statement of the problem We consider the equality constrained quadratic programming (QPE) problem min Cx=d 1 2 xAx+ bx+ ν (1) where C i...