Despite many theorists’ assertions and researchers’ findings that eating disturbances have personal, sociocultural, and relational correlates, no model of eating disorder symptomatology incorporating all 3 of these domains has been proposed. The purpose of this study, then, was to examine empirically such a model. Personal, sociocultural, and relational variables were chosen, based on their sol...

trust is one of the most important factors for the development of electronic banking. the purpose of this study is to determine effective factors on trust in e-banking in the form of a conceptual model. due to the rapid growth of electronic banking in the country, identify factors affecting trust in e-banking is very important. population of this study is customers of bank melli in urmia. we us...

College problem drinking and social anxiety are significant public health concerns with highly negative consequences. College students are faced with a variety of novel social situations and situations encouraging alcohol consumption. The current study involved developing a path model of college problem drinking, including social anxiety, in 316 college students referred to an alcohol intervent...

Ala~traet--Errors-in-variables problems are considered for the case of three variables, where the underlying relations among the noise-free variables are linear, and covariance information for the noisy variables is available. The static problem where the variables are complex (which can arise when narrowband filtering is used) is analysed in detail. Some results are also presented for the case...

We propose an algorithm for answering conjunctive queries with negation, where the negated relations are sparse. Its data complexity matches that of the best known algorithms for the positive subquery of the input query and is expressed in terms of the fractional hypertree width and the submodular width. The query complexity depends on the structure of the negated subquery; in general it is exp...

The paper consists of two parts. The rst one is a concise introduction to epistemic (both propositional and predicate) logic with common knowl-ege operator. As the full common knowledge predicate logics are not even recursively enumerable, in the second part we introduce and investigate the monodic fragment of these logics which allows applications of the epistemic operators to formulas with at...

Let z = (z1, z2, · · · , zn) be noncommutative free variables and t a formal parameter which commutes with z. Let k be a unital commutative ring of any characteristic and Ft(z) = z−Ht(z) with Ht(z) ∈ k[[t]]〈〈z〉〉 ×n and o(Ht(z)) ≥ 2. Note that Ft(z) can be viewed as a deformation of the formal map F (z) := z−Ht=1(z) when it makes sense. The inverse map Gt(z) of Ft(z) can always be written as Gt(...

In this paper we prove decidability of two kinds of branching time temporal logics. First we show that the non-local version of propositional , in which truth values of atoms may depend on the branch of evaluation, is decidable. Then we use this result to establish decidability of various fragments of quantified , where the next-time operator can be applied only to formulas with at most one fre...

Affine λ-terms are λ-terms in which each bound variable occurs at most once and linear λ-terms are λ-terms in which each bound variable occurs once. and only once. In this paper we count the number of closed affine λ-terms of size n, closed linear λ-terms of size n, affine β-normal forms of size n and linear β-normal forms of size n, for different ways of measuring the size of λ-terms. From the...

We consider reductions in Orthogonal Expression Reduction Systems (OERS), that is, Orthogonal Term Rewriting Systems with bound variables and substitutions, as in the-calculus. We design a strategy that for any given term t constructs a longest reduction starting from t if t is strongly normalizable, and constructs an innnite reduction otherwise. The Conservation Theorem for OERSs follows easil...