This paper is a continuation of [Uniformities and covering properties for partial frames (I)], in which we make use of the notion of a partial frame, which is a meet-semilattice in which certain designated subsets are required to have joins, and finite meets distribute over these. After presenting there our axiomatization of partial frames, which we call $sels$-frames, we added structure, in th...

Recently, we have used the symmetric bracket of vector fields, and developed the notion of the symmetric derivation. Using this machinery, we have defined the concept of symmetric curvature. This concept is natural and is related to the notions divergence and Laplacian of vector fields. This concept is also related to the derivations on the algebra of symmetric forms which has been discu...

This paper addresses the design of control charts for both variable ( x chart) andattribute (u and c charts) quality characteristics, when there is uncertainty about the processparameters or sample data. Derived control charts are more flexible than the strict crisp case, dueto the ability of encompassing the effects of vagueness in form of the degree of expert’spresumption. We extend the use o...

â â â  the study of al-rahman surah stylistics’ â â â  â  mohammad khaqani isfahani * â  maryam jalilian ** â  â  abstract â  â  stylistics as a modern method explores linguistic and stylistic phenomena since form or content by itself is not sufficient to attain the gist of the text. in stylistics, the quality of the connection of the two and their effect on leading to understand are worked o...

Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling means assigning a value to a variable.) Solu...

Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...