We introduce a new form of SAT-based symbolic model checking. One common idea in SAT-based symbolic model checking is to generate new clauses from states that can lead to property violations. Our previous work suggests applying induction to generalize from such states. While effective on some benchmarks, the main problem with inductive generalization is that not all such states can be inductive...

Abstract. In the mid-1980s B.N. Parsons [29] and the author [10] independently had the idea to generalize linear stationary k-step methods to stationary (k, l)-step methods, which were further generalized to nonstationary and even nonlinear (k, l)-step methods. Later, conjugate-gradient-type methods that are (k, l)-step methods of a similar sort were introduced and investigated in the PhD thesi...

Image segmentation based on an adaptive K-means clustering algorithm is presented. The proposed method tries to develop K-means algorithm to obtain high performance and efficiency. This method proposes initialization step in K-means algorithm. In addition, it solves a model selection number by determining the number of clusters using datasets from images by frame size and the absolute value bet...

Software is an integration of numerous programming modules  (e.g., functions, procedures, legacy system, reusable components, etc.) tested and combined to build the entire module. However, some undesired faults may occur due a change in modules while performing validation verification. Retesting software costly affair terms money time. Therefore, avoid retesting of entire&...

Split preorders are preordering relations on a domain whose composition is defined in a particular way by splitting the domain into two disjoint subsets. These relations and the associated composition arise in categorial proof theory in connection with coherence theorems. Here split preorders are represented isomorphically in the category whose arrows are binary relations, where composition is ...