A connection graph represents resolvability in a set of clauses explicitly. The corresponding connection graph proof procedure has the deeciency that the graphs may grow, becoming impractical to handle. We present a novel proof procedure for condition graphs, which is a reenement of connection graphs. Our idea is to control the growth of the graph by recognizing tests in clauses and translating...

The parallel time complexity of the linear programming prob lem with at most two variables per inequality is discussed Let n and m denote the number of variables and the number of inequalities respectively in a linear programming problem We describe an O logm log n log n time parallel al gorithm under the concurrent read exclusive write PRAM model for deciding fea sibility It requires mn logn p...

Mucins are highly immunogenic glycoproteins that are abundantly ex pressed by breast carcinomas and other carcinomas. The fact that deglycosylated normal mucin can induce tumor-specific monoclonal antibodies indicates that tumor-specific epitopes are hidden in the fully glycosylated form. Using recombinant DNA techniques, a fragment of mucin tandem repeats was inserted into pMal-p, an Escherich...

Laan in (Ph.D Thesis, Tartu. 1999) introduced the principal weak form of Condition $(P)$ as Condition $(PWP)$ and gave some characterization of monoids by this condition of their acts. In this paper first we introduce Condition (G-PWP), a generalization of Condition $(PWP)$ of acts over monoids and then will give a characterization of monoids when all right acts satisfy this condition. We also ...

In this paper we introduce condition (E?P) a generalization of Conditions (E?), (E) and (P) of acts over monoids and will give a classification of monoids by comparing this condition of their (Rees factor) acts with other properties. We give also a criterion of cyclic acts to satisfy Condition (E?P).

In this paper we present a propositional logic programming language for reasoning under possibilistic uncertainty and represent­ ing vague knowledge. Formulas are repre­ sented by pairs (ip, a), where ip is a many­ valued proposition and a E [0, 1] is a lower bound on the belief on ip in terms of necessity measures. Belief states are modeled by pos­ sibility distributions on the set of all many...

This paper describes an analog computer simulation of a manned orbital docking system conducted as a fe~sibility study. In addition to determining the possibility of a human operator performing guidance and attitude control functions with a minimum amount of displayed information, additional purposes of the study were to determine (1) terminal values of range rate, line-of-sight (LOS) angle, LO...

As stated in the previous section, thermal excitation of Goldstone modes destroys spontaneous order in two dimensional models with a broken continuous symmetry. The RG study of the non-linear σ-model confirms that the transition temperature of n-component spins vanishes as T ∗ = 2πǫ/(n − 2) for ǫ = (d − 2) → 0. However, the same RG procedure appears to suggest a different behavior for n = 2. Th...