in this paper a guided tabu search (gts) is utilized for optimal nodal ordering of finite element models (fems) leading to small profile for the stiffness matrices of the models. the search strategy is accelerated and a graph-theoretical approach is used as guidance. the method is evaluated by minimization of graph matrices pattern equivalent to stiffness matrices of finite element models. comp...

Background: Iatrogenic urethral injury is a well-known risk of urinary catheter insertion. Associated morbidities include stricture formation, catheter associated infection, risk for instrumentation, and extended length of stay. Yet, insufficient attention is paid to its prevention. Objective: This study aimed to assess the effectiveness of a computerized...

Regarding the literary historical debates, one of the main concerns of modern historiography is the way of representing the concept of reality within the framework of a coherent narrative, a reality that is only achievable through the process of narrative that is supposed to be constructive and ordering. Therefore, in order to examine this ordering process of narrative in James Joyce's novel, A...

We present in this paper a new procedure to saturate a set of clauses with respect to a well-founded ordering on ground atoms such that A ≺ B implies V arA ⊆ Var(B) for every atoms A and B. This condition is satisfied by any atom ordering compatible with a lexicographic, recursive, or multiset path ordering on terms. Our saturation procedure is based on a priori ordered resolution and its main ...

We aim to improve the accuracy of path selectivity estimation in graph databases by intelligently ordering the domain of a histogram used for estimation. This problem has not, to our knowledge, received adequate attention in the research community. We present a novel framework for the systematic study of path ordering strategies in histogram construction and use. In this framework, we introduce...

This paper introduces VLib, an extension to LOTOS that eases the specification of data types. It allows the definition and use of virtual libraries containing conceptually an infinite number of data types. The extraction of a working finite subset for a particular application is also considered. After a general introduction to LOTOS data specification issues, the extension is explained and form...

In most termination tools two ingredients, namely recursive path orderings (RPO) and polynomial interpretation orderings (POLO), are used in a consecutive disjoint way to solve the final constraints generated from the termination problem. In this paper we present a simple ordering that combines both RPO and POLO and defines a family of orderings that includes both, and extend them with the poss...

The problem of extending a given LOTOS speciication P to a new given version R through the addition of a component X to be developed by scratch can be formulated in terms of an equation on LOTOS terms. The algorithmic solution of such an equation is a technical problem that has not been solved in a completely satisfactorily manner till now. In this paper we present an algorithm for the solution...